Planning and Scheduling Jobs on Grid Computing

Planning and scheduling in the Grid System allow applications to request resources from multiple scheduling systems at any given time in the future, by gaining simultaneous access to resources sufficient for their deployment. Existing scheduling strategies will deny incoming jobs if the requested resource is not available on time. Therefore, the job scheduling algorithm is one of the key areas in Grid Computing. This paper first describes the First Come First Serve Ejecting Based Dynamic Scheduling (FCFS-EDS), a job scheduling model used in Grid Computing environments, then discusses proposed job scheduling algorithms and system grid architectures as required. Finally, the proposed algorithm can perform job scheduling, as well as increase execution time for use in Grid Computing environments.