Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2015.060514
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 6 Issue 5, 2015.
Abstract: Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems. Some algorithms have been proposed for both homogeneous and heterogeneous distributed computing systems. In this paper, a new static scheduling algorithm is proposed called Node Duplication in Critical Path (NDCP) algorithm to schedule the tasks efficiently on the heterogeneous distributed computing systems. The NDCP algorithm focuses on reducing the makespan and provides better performance than the other algorithms in metrics of speedup and efficiency. It consists of two phases, priority phase and processor selection phase. From the theoretical analysis of the NDCP algorithm with other algorithms for a Directed Acyclic Graph (DAG), the better performance is observed.
Aida A. NASR, Nirmeen A. EL-BAHNASAWY and Ayman EL-SAYED, “Performance Enhancement of Scheduling Algorithm in Heterogeneous Distributed Computing Systems” International Journal of Advanced Computer Science and Applications(IJACSA), 6(5), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060514