On the complexity of mapping linear chain applications onto heterogeneous platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Parallel Processing Letters Year : 2009

On the complexity of mapping linear chain applications onto heterogeneous platforms

Abstract

In this paper, we explore the problem of mapping linear chain applications onto large-scale heterogeneous platforms. A series of data sets enter the input stage and progress from stage to stage until the final result is computed. An important optimization criterion that should be considered in such a framework is the latency, or makespan, which measures the response time of the system in order to process one single data set entirely. For such applications, which are representative of a broad class of real-life applications, we can consider one-to-one mappings, in which each stage is mapped onto a single processor. However, in order to reduce the communication cost, it seems natural to group stages into intervals. The interval mapping problem can be solved in a straightforward way if the platform has homogeneous communications: the whole chain is grouped into a single interval, which in turn is mapped onto the fastest processor. But the problem becomes harder when considering a fully heterogeneous platform. Indeed, we prove the NP-completeness of this problem. Furthermore, we prove that neither the interval mapping problem nor the similar one-to-one mapping problem can be approximated in polynomial time by any constant factor (unless P=NP).

Dates and versions

hal-00786381 , version 1 (08-02-2013)

Identifiers

Cite

Anne Benoit, Eric Thierry, Yves Robert. On the complexity of mapping linear chain applications onto heterogeneous platforms. Parallel Processing Letters, 2009, 19 (3), pp.383-397. ⟨10.1142/S0129626409000298⟩. ⟨hal-00786381⟩
60 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More