Paper Title
REVIEW ON THE GRID ARCHITECTURE FOR SCHEDULING AND LOAD BALANCING

Abstract
Grid is defined as “A type of parallel and distributed system that enables the sharing, selection, and aggregation of geographically distributed autonomous and heterogeneous resources dynamically at runtime depending on their availability, capability, performance, cost, and users' quality-of-service requirements”. Grid computing appears to be a promising trend for reasons such as its ability to make more cost-effective use of a given amount of computer resources, a way to solve problems that cannot be approached without an enormous amount of computing power, and the resources of many computers can be cooperatively and managed as a collaboration toward a common objective. A task in a grid is associated with the following parameters such as CPU/ Memory Size, deadline to complete the task, Priority etc. Scheduling is the process of ordering tasks on computational resources and ordering communication between tasks. It is carried out for shortening the job completion time and to improve the system throughput. A poor scheduling policy may leave many processors idle while a clever one may consume an unduly large portion of the total CPU cycles. Load balance is also an important issue in grid environment. The purpose of load balancing is to balance the load of each resource in order to enhance the resource utilization and increase the system throughput. The main objective of load balancing method is to speed up the execution of applications on resources whose workload varies at run time in unpredictable way. In this paper the various classification of the scheduling algorithms and the factors associated with load balancing algorithms are reviewed along with their tools and their application areas and a design model has been proposed for Grid Scheduling.