Scheduling Algorithms for a Fork DAG in a NOWs

Authors:
Zhenying Liu;Binxing Fang;Yi Zhang;Jianqi Tang
Affiliations:
-;-;-;-
Venue:
HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Year:
2000

Citing 0
Cited 2

A Stochastic Approach to Estimating Earliest Start Times of Nodes for Scheduling DAGs on Heterogeneous Distributed Computing Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
An efficient A* algorithm for the directed linear arrangement problem

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.