Paper Details

The major component of any computing system is the scheduling technique that coordinates the entirefunctionality of system. Heterogeneous Environments depend on scheduling algorithms to execute real life applications.Targeting high performance is found to be the objective of every scheduling algorithm. Scheduling gives the exact plan ofhow the resources are to be mapped between processes, which turns out as quality performances. The computationaldemand, diversity among the tasks, heterogeneity of resources, heterogeneity of vendors who offer services, the dynamicnature of the resources are the primary factors in a heterogeneous environment. This paper addresses a schedulingalgorithm, which considers dependencies of the tasks, the computation cost and communication cost of the resources tominimize the schedule length of defined sets of tasks on finite number of resources. The algorithm uses bin-packing techniqueto group the tasks. Tasks from groups are compared and prioritized for scheduling. It is found that the simulated results ofthe proposed algorithm overcome the compared algorithms. The proposed algorithm outperforms the compared algorithmsin terms of schedule length, speed up, load balancing and resource utilization.

P. Muthulakshmi, Aarthi E, P.Yogalakshmi, “TDATE: A NEW APPROACH TOWARDS OPTIMAL SCHEDULING IN GRID ENVIRONMENT”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 5, Issue 1, pp. 958-965, January 2018.