Predictive, reactive and replication-based load balancing of tasks in Chameleon and sam(oa) 2

Platform for Advanced Scientific Computing Conference (PASC), pp. 1–10

Abstract

Increasingly complex hardware architectures as well as numerical algorithms make balancing load in parallel numerical software for adaptive mesh refinement an inherently difficult task, especially if variability of system components and unpredictability of execution time comes into play. Yet, traditional predictive load balancing strategies are largely based on cost models that aim to predict the execution time of computational tasks. To address this fundamental weakness, we present a novel reactive load balancing approach in distributed memory for MPI+OpenMP parallel applications that is based on keeping tasks speculatively replicated on multiple MPI processes. Replicated tasks are scheduled fully reactively without the need of a predictive cost model. Task cancellation mechanisms help to keep the overhead of replication minimal by avoiding redundant computation of replicated tasks. We implemented our approach in the Chameleon library for reactive load balancing building upon previous work on reactive task migration. Our experiments in the parallel dynamic adaptive mesh refinement software sam(oa)2 demonstrate performance improvements in the presence of wrong cost models and artificially introduced noise to simulate imbalances coming from hardware variability.

Authors 3

1. Philipp Samfaß

   Technical University of Munich

   Affiliation as printed

   Technical University of Munich, Garching, Germany

2. Jannis Klinkenberg Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

3. Minh Thanh Chung

   Ludwig-Maximilians-Universität München

   Affiliation as printed

   Ludwig-Maximilians-Universitaet, Munich, Germany