An augnnentation-based algorithm for task scheduling in parallel systems

Raj Vemulapalli, Hesham H. Ali

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationArchitecture and Software Technology
PublisherIEEE Computer Society
Pages666-667
Number of pages2
ISBN (Electronic)0818673249
DOIs
StatePublished - 1996
Event29th Hawaii International Conference on System Sciences, HICSS 1996 - Wailea, United States
Duration: Jan 3 1996Jan 6 1996

Publication series

NameProceedings of the Annual Hawaii International Conference on System Sciences
Volume1
ISSN (Print)1530-1605

Conference

Conference29th Hawaii International Conference on System Sciences, HICSS 1996
CountryUnited States
CityWailea
Period1/3/961/6/96

ASJC Scopus subject areas

  • Engineering(all)

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