A new scheduling algorithm design for grid computing tasks

Geographically distributed resources cooperate to solve big problems, is called grid computing. Grid computing, is distributed computing model that is provides easy access to heterogeneous resources that are geographically dispersed. Today, due to heterogeneous grid resources that belong to different organizations and locations with different access policies and terms of workload dynamics are inherent; the use of this type in grade sharing, selection and gathering resources computing has become popular. Scheduling in grid computing systems that are normally non-concentrated is important in military, mobile medical and laboratory control systems. Scheduling in grid computing is an inconclusive issue, so cannot used be certain of the algorithms to improve scheduling. In traditional scheduling approaches at grid computing, scheduling time to complete tasks is considered as the most important parameter, while the timing of the economic schedulers should also implement time jobs, cost of resource use is considered.The algorithm proposed in this paper that called GCDM, considering the cost of data transfer between different tasks and dependencies between tasks, with the modeling as an acyclic directed graph (DAG), ultimately leads to minimize the final cost of implementation tasks

Keywords:

Grid computing , schedule , optimization , DAG , GCDM