File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors
Title | Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors |
---|---|
Authors | |
Keywords | Algorithms Parallel processing Heterogeneous systems Scheduling Link contention |
Issue Date | 1999 |
Publisher | IEEE. |
Citation | International Conference on Parallel Processing Proceedings, Aizu-Wakamatsu City, Japan, 21-24 September 1999, p. 551-558 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/46210 |
ISSN | 2020 SCImago Journal Rankings: 0.269 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwok, YK | en_HK |
dc.contributor.author | Ahmad, I | en_HK |
dc.date.accessioned | 2007-10-30T06:44:52Z | - |
dc.date.available | 2007-10-30T06:44:52Z | - |
dc.date.issued | 1999 | en_HK |
dc.identifier.citation | International Conference on Parallel Processing Proceedings, Aizu-Wakamatsu City, Japan, 21-24 September 1999, p. 551-558 | en_HK |
dc.identifier.issn | 0190-3918 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46210 | - |
dc.description.abstract | In 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.extent | 120198 bytes | - |
dc.format.extent | 10776 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | International 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. | - |
dc.subject | Algorithms | en_HK |
dc.subject | Parallel processing | en_HK |
dc.subject | Heterogeneous systems | en_HK |
dc.subject | Scheduling | en_HK |
dc.subject | Link contention | en_HK |
dc.title | Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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+processors | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICPP.1999.797444 | en_HK |
dc.identifier.hkuros | 54119 | - |
dc.identifier.issnl | 0190-3918 | - |