Skip to Main content Skip to Navigation
New interface
Journal articles

Complexity results for throughput and latency optimization of replicated and data-parallel workflows

Anne Benoit 1, 2 Yves Robert 1, 2 
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Mapping applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline or fork graphs. Several antagonist criteria should be optimized for workflow applications, such as throughput and latency (or a combination). In this paper, we consider a simplified model with no communication cost, and we provide an exhaustive list of complexity results for different problem instances. Pipeline or fork stages can be replicated in order to increase the throughput by sending consecutive data sets onto different processors. In some cases, stages can also be data-parallelized, i.e. the computation of one single data set is shared between several processors. This leads to a decrease of the latency and an increase of the throughput. Some instances of this simple model are shown to be NP-hard, thereby exposing the inherent complexity of the mapping problem. We provide polynomial algorithms for other problem instances. Altogether, we provide solid theoretical foundations for the study of mono-criterion or bi-criteria mapping optimization problems.
Complete list of metadata
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Friday, April 18, 2014 - 3:53:46 PM
Last modification on : Tuesday, October 25, 2022 - 4:17:02 PM

Links full text




Anne Benoit, Yves Robert. Complexity results for throughput and latency optimization of replicated and data-parallel workflows. Algorithmica, 2010, 57 (4), pp.689-724. ⟨10.1007/s00453-008-9229-4⟩. ⟨hal-00980695⟩



Record views