Volume 49, Number 2, April-May 2015
New challenges in scheduling theory
|Page(s)||339 - 368|
|Published online||19 January 2015|
Scheduling Multilayer Divisible Computations∗
1 Faculty of Mathematics and Computer
Science, Adam Mickiewicz University, Umultowska 87, 61-614
2 Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland.
Accepted: 24 February 2014
We analyze scheduling multilayer divisible computations. Multilayer computations consist of a chain of parallel applications, such that one application produces input for the next one. A simple form of multilayer computations are MapReduce parallel applications. The operations of mapping and reducing are two divisible applications with precedence constraints. We propose a divisible load model and give an algorithm for scheduling multilayer divisible computations. The algorithm is tested in a series of computational experiments. We draw conclusions on schedule patterns and determinants of the performance.
Mathematics Subject Classification: 90B35 / 68M20 / 68M14
Key words: Scheduling / divisible loads / parallel processing / multilayer computations / MapReduce
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.