UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads

In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. Multi-round scheduling has been used for divisible workloads in previous work and our contribution is as follows. We use “uniform” rounds, i.e. a fixed amount of work is sent out to all workers at each round. This restriction makes it possible to compute an approximately optimal number of rounds, which was not possible for previously proposed algorithms. In addition, we use more realistic platform models than those used in previous works. We provide an analysis of our algorithm both for homogeneous and heterogeneous platforms and present simulation results to quantify the benefits of our approach.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Yang Yang, Henri Casanova
• Keywords: Algorithm, Distributed And Parallel Computing, Divisible Workloads, IPPS 2003, Multiple Rounds