| | |
Summary: 1
Mapping Linear Workflows
with Computation/Communication Overlap
Kunal Agrawal1
, Anne Benoit,2
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
Abstract
This paper presents theoretical results related to mapping and scheduling linear workflows onto
heterogeneous platforms. We use a realistic architectural model with bounded communication 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 homogeneous platforms and minimizing the latency
is NP-complete for heterogeneous platforms. Moreover, we present an approximation algorithm for
throughput maximization for linear chain applications on homogeneous platforms, and an approximation
|
