Title :
Scheduling algorithms for a fork DAG in a NOWs
Author :
Liu, Zhenying ; Fang, Binxing ; Zhang, Yi ; Tang, Jianqi
Author_Institution :
Dept. of Comput. Sci. & Eng., Harbin Inst. of Technol., China
Abstract :
An effective scheduling algorithm is a key to achieve high performance in a network of workstations (NOWs). Based on the task duplication, two new scheduling algorithms are presented respectively in the environment of homogeneity and heterogeneity with the shortest scheduling length, low complexity, and less number of processors in comparison with the previous algorithms.
Keywords :
computational complexity; directed graphs; processor scheduling; workstation clusters; NOWs; fork directed acyclic graphs; heterogeneity; homogeneity; low complexity; network of workstations; scheduling algorithms; shortest scheduling length; task duplication;
Conference_Titel :
High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on
Conference_Location :
Beijing, China
Print_ISBN :
0-7695-0589-2
DOI :
10.1109/HPC.2000.843579
