TY - GEN
T1 - An augnnentation-based algorithm for task scheduling in parallel systems
AU - Vemulapalli, Raj
AU - Ali, Hesham H.
N1 - Publisher Copyright:
© 1996 IEEE.
PY - 1996
Y1 - 1996
N2 - The problem of scheduling tasks on parallel systems has been shown to be computationally intractable in its general form as well as many restricted cases, In this paper, we introduce a two-step Augmentation basear algorithm for scheduling general task graphs in parallel Jystems. Several experimental studies have been conducted to compare the performance of the proposed technique with several known heuristics. The obtained results show that th!eaugmentation based algorithm out-performed other heuristics on most of the randomly-generated task graphs.
AB - The problem of scheduling tasks on parallel systems has been shown to be computationally intractable in its general form as well as many restricted cases, In this paper, we introduce a two-step Augmentation basear algorithm for scheduling general task graphs in parallel Jystems. Several experimental studies have been conducted to compare the performance of the proposed technique with several known heuristics. The obtained results show that th!eaugmentation based algorithm out-performed other heuristics on most of the randomly-generated task graphs.
UR - http://www.scopus.com/inward/record.url?scp=85067788936&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067788936&partnerID=8YFLogxK
U2 - 10.1109/HICSS.1996.495518
DO - 10.1109/HICSS.1996.495518
M3 - Conference contribution
AN - SCOPUS:85067788936
T3 - Proceedings of the Annual Hawaii International Conference on System Sciences
SP - 666
EP - 667
BT - Architecture and Software Technology
PB - IEEE Computer Society
T2 - 29th Hawaii International Conference on System Sciences, HICSS 1996
Y2 - 3 January 1996 through 6 January 1996
ER -