Asian Journal of Information Technology

Year: 2016
Volume: 15
Issue: 13
Page No. 2147 - 2153

Sort Completion Time Mean Tasks Scheduling Algorithm in Decentralized Grid Environment

Authors : G.K. Kamalam

Abstract: Scheduling task on a heterogeneous distributed grid environment is a challenging one and in general, has been shown to be a NP-Complete problem. To solve the complicated scheduling problem, an efficient scheduling algorithm is essential. The major aim of the scheduling algorithm is in maximizing the resources utilization and in minimizing the makespan. This study addresses the complicated scheduling problem by proposing an efficient scheduling algorithm, Sort Completion Time Mean Tasks Scheduling algorithm (SCTMTS) which determines the order in which the tasks are to be scheduled to the appropriate resources. The first step is to sort the list of completion time of the task. The second step is to find the mean value of each task. Then the maximum mean value is obtained. Finally, the task that has the maximum mean value is selected and scheduled to the resource that has the minimum completion time. Experimental results reveal that the proposed sort completion time mean tasks scheduling algorithm outperforms min-min heuristic scheduling algorithm regarding both makespan and resource utilization.

How to cite this article:

G.K. Kamalam , 2016. Sort Completion Time Mean Tasks Scheduling Algorithm in Decentralized Grid Environment. Asian Journal of Information Technology, 15: 2147-2153.

Design and power by Medwell Web Development Team. © Medwell Publishing 2022 All Rights Reserved