Scheduling algorithms for a fork DAG in a NOWs

摘要

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.