Bubble scheduling: a quasi dynamic algorithm for static allocation of tasks to parallel architectures

Yu Kwong Kwok, Ishfaq Ahmad

Research output: Contribution to journalConference articlepeer-review

25 Citations (Scopus)

Abstract

We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is static, the algorithm is quasi dynamic because it is not specific to any particular system topology and thus can be used at run-time for the processor configuration available at that time. The proposed algorithm, called Bubble Scheduling and Allocation (BSA) algorithm, works by first serializing the task graph and 'injecting' all the tasks to one processor. The parallel tasks are then 'bubbled up' to other processors and are inserted at appropriate time slots. The edges among the tasks are also scheduled by treating communication links between the processors as resources. The scheduling of messages on the links depends on the routing strategy, such as circuit switching and wormhole routing, of the underlying network. The proposed algorithm has admissible time complexity and is suitable for regular as well as irregular task graph structures.

Original languageEnglish
Pages (from-to)36-43
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, USA
Duration: 25 Oct 199528 Oct 1995

Fingerprint

Dive into the research topics of 'Bubble scheduling: a quasi dynamic algorithm for static allocation of tasks to parallel architectures'. Together they form a unique fingerprint.

Cite this