DocumentCode :
1991099
Title :
Contention-Free Scheduling in a Dynamic Context
Author :
Millot, Daniel ; Parrot, Christian
Author_Institution :
Dept. Inf., TELECOM et Manage. SudParis, Evry
fYear :
2008
fDate :
8-10 Dec. 2008
Firstpage :
19
Lastpage :
26
Abstract :
In this paper, we present an adaptive method for scheduling parallel applications on heterogeneous multi-processor platforms, in a dynamic context. When executing divisible load applications according to a master-worker model, this method delivers the workload through multiple rounds and can avoid contentions in the use of the network. Such contentions avoidance is a means to avoid idle time, thus to maximize the throughput. Before presenting the proposed scheduling method, the paper revisits a runtime method which motivated its development. The method presented in this paper can be used to schedule parallel applications whose total workload is large but unknown a priori.
Keywords :
multiprocessing systems; parallel processing; scheduling; adaptive method; contention-free scheduling; dynamic context; heterogeneous multiprocessor; master-worker model; parallel application; runtime method; Dynamic scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on
Conference_Location :
Melbourne, VIC
ISSN :
1521-9097
Print_ISBN :
978-0-7695-3434-3
Type :
conf
DOI :
10.1109/ICPADS.2008.23
Filename :
4724298
Link To Document :
بازگشت