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

Anne Benoit 1, 2 Yves Robert 1, 2
2 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 of the workflow, 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 metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00175066
Contributor : Anne Benoit <>
Submitted on : Thursday, September 27, 2007 - 5:48:52 PM
Last modification on : Tuesday, May 21, 2019 - 2:26:05 PM

Identifiers

  • HAL Id : inria-00175066, version 2

Collections

Citation

Anne Benoit, Yves Robert. Complexity results for throughput and latency optimization of replicated and data-parallel workflows. [Research Report] RR-6308, LIP RR-2007-12, INRIA, LIP. 2007, pp.33. ⟨inria-00175066v2⟩

Share

Metrics

Record views

704

Files downloads

475