Task – Heterogeneous Resource Mapping Algorithm for Grid Environment
1Dr.G.K.Kamalam Assistant Professor(SLG) in Kongu Engineering College Erode.
2Ms.B.Anitha, Assistant Professor in Kongu Engineering College Erode.
Manuscript received on November 11, 2019. | Revised Manuscript received on November 20 2019. | Manuscript published on 30 November, 2019. | PP: 10906-10909 | Volume-8 Issue-4, November 2019. | Retrieval Number: D4347118419/2019©BEIESP | DOI: 10.35940/ijrte.D4347.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In grid, scheduling algorithms play vital role of mapping a set of tasks to the available heterogeneous resources. Extant literatures have shown that the task mapping problem is an NP-Complete problem. Heuristic scheduling algorithm aims to obtain the minimum overall execution time of the set of tasks. In this paper, we address the problem of scheduling a set of n tasks with a set of m resources, such that the makespan is minimized. The proposed task scheduling algorithm (RTS) is based on the well-known optimization algorithm, called Hungarian algorithm. (RTS) algorithm considers an equal number of tasks and resources, and maps the tasks to the resources and makes an effective scheduling decision. We simulate the (RTS) algorithm and compare it with the Min-min heuristic scheduling algorithm. The performance evaluation shows that (RTS) produces minimized makespan and better resource utilization in comparison to existing Min-min.
Keywords: Hungarian Method, Heuristic Algorithm, Optimization, Task Scheduling.
Scope of the Article: Algorithm Engineering.