By Topic

Contention-Free Scheduling in a Dynamic Context

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Millot, D. ; Dept. Inf., TELECOM et Manage. SudParis, Evry ; Parrot, C.

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.

Published in:

Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on

Date of Conference:

8-10 Dec. 2008