2 research outputs found
Scheduling Multilayer Divisible Computations
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