(Created page with " == Abstract == Mapping a pipelined application onto a distributed and parallel platform is a challenging problem. The problem becomes even more difficult when multiple optim...") |
m (Scipediacontent moved page Draft Content 322297251 to Robert et al 2010a) |
(No difference)
| |
Latest revision as of 20:15, 3 February 2021
Abstract
Mapping a pipelined application onto a distributed and parallel platform is a challenging problem. The problem becomes even more difficult when multiple optimization criteria are involved, and when the target resources are heterogeneous (processors and communication links) and subject to failures. This report investigates the problem of mapping pipelined applications, consisting of a linear chain of stages executed in a pipeline way, onto such platforms. The objective is to optimize the reliability under a performance constraint, i.e., while guaranteeing a threshold throughput. In order to increase reliability, we replicate the execution of stages on multiple processors. We present complexity results, proving that this bi-criteria optimization problem is NP-hard. We then propose some heuristics, and present extensive experiments evaluating their performance.
Original document
The different versions of the original document can be found in:
- https://link.springer.com/article/10.1007/s10766-011-0165-6,
- http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005532475,
- https://ieeexplore.ieee.org/document/5532475,
- http://ieeexplore.ieee.org/document/5532475,
- https://hal.inria.fr/inria-00574608,
- https://dblp.uni-trier.de/db/conf/ispdc/ispdc2010.html#BenoitBR10,
- https://hal.archives-ouvertes.fr/hal-00457207,
- https://hal-lara.archives-ouvertes.fr/LIP/inria-00574608,
- https://academic.microsoft.com/#/detail/2124594609
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1109/ispdc.2010.9
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?