An efficient scheduling algorithm is one of the key factors in determining the performance of distributed memory machines. The paper presents a search and duplication based scheduling (SDBS) algorithm which can schedule directed acyclic graphs (DAGs). The complexity of this scheduling algorithm is in O(V+E), where V is the number of nodes and E is the number of edges in the task graph. This algorithm is based on some realistic assumptions and generates an optimal time schedule. If the assumptions cannot be completely satisfied then the algorithm provides a schedule which is close to optimal. The performance in these cases has been obtained using extensive simulation work which indicate the closeness of the results.
展开▼
