File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors

TitleLink contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors
Authors
KeywordsAlgorithms
Parallel processing
Heterogeneous systems
Scheduling
Link contention
Issue Date1999
PublisherIEEE.
Citation
International Conference on Parallel Processing Proceedings, Aizu-Wakamatsu City, Japan, 21-24 September 1999, p. 551-558 How to Cite?
AbstractIn this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well as the communication traffic by treating both the processors and communication links as important resources. We propose an algorithm that achieves these objectives and adapts its tasks scheduling and mapping decisions according to the given network topology. Just like tasks, messages are also scheduled and mapped to suitable links during the minimization of the finish times of tasks. Heterogeneity of processors is exploited by scheduling critical tasks to the fastest processors. Our extensive experimental study has demonstrated that the proposed algorithm is efficient, robust, and yields consistent performance over a wide range of scheduling parameters.
Persistent Identifierhttp://hdl.handle.net/10722/46210
ISSN

 

DC FieldValueLanguage
dc.contributor.authorKwok, YKen_HK
dc.contributor.authorAhmad, Ien_HK
dc.date.accessioned2007-10-30T06:44:52Z-
dc.date.available2007-10-30T06:44:52Z-
dc.date.issued1999en_HK
dc.identifier.citationInternational Conference on Parallel Processing Proceedings, Aizu-Wakamatsu City, Japan, 21-24 September 1999, p. 551-558en_HK
dc.identifier.issn0190-3918en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46210-
dc.description.abstractIn this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well as the communication traffic by treating both the processors and communication links as important resources. We propose an algorithm that achieves these objectives and adapts its tasks scheduling and mapping decisions according to the given network topology. Just like tasks, messages are also scheduled and mapped to suitable links during the minimization of the finish times of tasks. Heterogeneity of processors is exploited by scheduling critical tasks to the fastest processors. Our extensive experimental study has demonstrated that the proposed algorithm is efficient, robust, and yields consistent performance over a wide range of scheduling parameters.en_HK
dc.format.extent120198 bytes-
dc.format.extent10776 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference on Parallel Processing Proceedings-
dc.rights©1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectAlgorithmsen_HK
dc.subjectParallel processingen_HK
dc.subjectHeterogeneous systemsen_HK
dc.subjectSchedulingen_HK
dc.subjectLink contentionen_HK
dc.titleLink contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processorsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0190-3918&volume=&spage=551&epage=558&date=1999&atitle=Link+contention-constrained+scheduling+and+mapping+of+tasks+and+messages+to+a+network+of+heterogeneous+processorsen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICPP.1999.797444en_HK
dc.identifier.hkuros54119-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats