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.
Kamalam*, Dr. G. K., & Anitha, Ms. B. (2019). Task – Heterogeneous Resource Mapping Algorithm for Grid Environment. International Journal of Recent Technology and Engineering (IJRTE), 8(4), 10906–10909. https://doi.org/10.35940/ijrte.d4347.118419
Mendeley helps you to discover research relevant for your work.