An augnnentation-based algorithm for task scheduling in parallel systems

Raj Vemulapalli; Hesham H. Ali

doi:10.1109/HICSS.1996.495518

An augnnentation-based algorithm for task scheduling in parallel systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English (US)
Title of host publication	Architecture and Software Technology
Publisher	IEEE Computer Society
Pages	666-667
Number of pages	2
ISBN (Electronic)	0818673249
DOIs	https://doi.org/10.1109/HICSS.1996.495518
State	Published - 1996
Event	29th Hawaii International Conference on System Sciences, HICSS 1996 - Wailea, United States Duration: Jan 3 1996 → Jan 6 1996

Publication series

Name	Proceedings of the Annual Hawaii International Conference on System Sciences
Volume	1
ISSN (Print)	1530-1605

Conference

Conference	29th Hawaii International Conference on System Sciences, HICSS 1996
Country	United States
City	Wailea
Period	1/3/96 → 1/6/96

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/HICSS.1996.495518

Fingerprint Dive into the research topics of 'An augnnentation-based algorithm for task scheduling in parallel systems'. Together they form a unique fingerprint.

Cite this

An augnnentation-based algorithm for task scheduling in parallel systems. / Vemulapalli, Raj; Ali, Hesham H.

Architecture and Software Technology. IEEE Computer Society, 1996. p. 666-667 495518 (Proceedings of the Annual Hawaii International Conference on System Sciences; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Vemulapalli, R & Ali, HH 1996, An augnnentation-based algorithm for task scheduling in parallel systems. in Architecture and Software Technology., 495518, Proceedings of the Annual Hawaii International Conference on System Sciences, vol. 1, IEEE Computer Society, pp. 666-667, 29th Hawaii International Conference on System Sciences, HICSS 1996, Wailea, United States, 1/3/96. https://doi.org/10.1109/HICSS.1996.495518

@inproceedings{89f41c716aff43b0aa0ffeaa0586e0b6,

title = "An augnnentation-based algorithm for task scheduling in parallel systems",

abstract = "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.",

author = "Raj Vemulapalli and Ali, {Hesham H.}",

year = "1996",

doi = "10.1109/HICSS.1996.495518",

language = "English (US)",

series = "Proceedings of the Annual Hawaii International Conference on System Sciences",

publisher = "IEEE Computer Society",

pages = "666--667",

booktitle = "Architecture and Software Technology",

note = "29th Hawaii International Conference on System Sciences, HICSS 1996 ; Conference date: 03-01-1996 Through 06-01-1996",

}

TY - GEN

T1 - An augnnentation-based algorithm for task scheduling in parallel systems

AU - Vemulapalli, Raj

AU - Ali, Hesham H.

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 -