Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Mapping linear workflows with computation/communication overlap
 

Summary: Mapping linear workflows
with computation/communication overlap
Kunal Agrawal1
, Anne Benoit2
and Yves Robert2
1
CSAIL, Massachusetts Institute of Technology, USA
2
LIP, ´Ecole Normale Sup´erieure de Lyon, France
kunal ag@mit.edu,{Anne.Benoit|Yves.Robert}@ens-lyon.fr
June 2008
LIP Research Report RR-2008-21
Abstract
This paper presents theoretical results related to mapping and scheduling linear workflows
onto heterogeneous platforms. We use a realistic architectural model with bounded communi-
cation capabilities and full computation/communication overlap. This model is representative
of current multi-threaded systems. In these workflow applications, the goal is often to maximize
throughput or to minimize latency. We present several complexity results related to both these
criteria.
To be precise, we prove that maximizing the throughput is NP-complete even for homo-

  

Source: Agrawal, Kunal - Department of Computer Science and Engineering, Washington University in St. Louis

 

Collections: Computer Technologies and Information Sciences