{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T14:27:07Z","timestamp":1681568827385},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:p> 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). <\/jats:p>","DOI":"10.1142\/s0129626409000298","type":"journal-article","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T07:08:41Z","timestamp":1248937721000},"page":"383-397","source":"Crossref","is-referenced-by-count":5,"title":["ON THE COMPLEXITY OF MAPPING LINEAR CHAIN APPLICATIONS ONTO HETEROGENEOUS PLATFORMS"],"prefix":"10.1142","volume":"19","author":[{"given":"ANNE","family":"BENOIT","sequence":"first","affiliation":[{"name":"LIP, ENS Lyon, 46 All\u00e9e d'Italie, 69364 Lyon Cedex 07, France"},{"name":"UMR 5668 - Universit\u00e9 de Lyon - CNRS - ENS Lyon - UCB Lyon - INRIA, France"}]},{"given":"YVES","family":"ROBERT","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, 46 All\u00e9e d'Italie, 69364 Lyon Cedex 07, France"},{"name":"UMR 5668 - Universit\u00e9 de Lyon - CNRS - ENS Lyon - UCB Lyon - INRIA, France"}]},{"given":"ERIC","family":"THIERRY","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, 46 All\u00e9e d'Italie, 69364 Lyon Cedex 07, France"},{"name":"UMR 5668 - Universit\u00e9 de Lyon - CNRS - ENS Lyon - UCB Lyon - INRIA, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Scheduling and load balancing in parallel and distributed systems","author":"Shirazi B. A.","year":"1995"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2003.12.002"},{"key":"rf3","volume-title":"Patterns and Skeletons for Parallel and Distributed Computing","author":"Rabhi F.","year":"2002"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00008-X"},{"key":"rf9","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(01)00070-X"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626409000298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:15:56Z","timestamp":1565108156000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626409000298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1142\/S0129626409000298"],"URL":"https:\/\/doi.org\/10.1142\/s0129626409000298","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}