File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleBubble scheduling: a quasi dynamic algorithm for static allocation of tasks to parallel architectures
Authors
Issue Date1995
Citation
Ieee Symposium On Parallel And Distributed Processing - Proceedings, 1995, p. 36-43 How to Cite?
AbstractWe 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.
Persistent Identifierhttp://hdl.handle.net/10722/158165
ISSN

 

DC FieldValueLanguage
dc.contributor.authorKwok, YuKwongen_US
dc.contributor.authorAhmad, Ishfaqen_US
dc.date.accessioned2012-08-08T08:58:20Z-
dc.date.available2012-08-08T08:58:20Z-
dc.date.issued1995en_US
dc.identifier.citationIeee Symposium On Parallel And Distributed Processing - Proceedings, 1995, p. 36-43en_US
dc.identifier.issn1063-6374en_US
dc.identifier.urihttp://hdl.handle.net/10722/158165-
dc.description.abstractWe 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.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Symposium on Parallel and Distributed Processing - Proceedingsen_US
dc.titleBubble scheduling: a quasi dynamic algorithm for static allocation of tasks to parallel architecturesen_US
dc.typeConference_Paperen_US
dc.identifier.emailKwok, YuKwong:ykwok@eee.hku.hken_US
dc.identifier.authorityKwok, YuKwong=rp00128en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0029507443en_US
dc.identifier.spage36en_US
dc.identifier.epage43en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridKwok, YuKwong=7101857718en_US
dc.identifier.scopusauthoridAhmad, Ishfaq=7201878459en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats