Orchestration by approximation mapping stream programs onto multicore architectures

S. M. Farhad, Yousun Ko, bernd Burgstaller, Bernhard Scholz

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We present a novel 2-approximation algorithm for deploying stream graphs on multicore computers and a stream graph transformation that eliminates bottlenecks. The key technical insight is a data rate transfer model that enables the computation of a "closed form", i.e., the data rate transfer function of an actor depending on the arrival rate of the stream program. A combinatorial optimization problem uses the closed form to maximize the throughput of the stream program. Although the problem is inherently NP-hard, we present an efficient and effective 2-approximation algorithm that provides a lower bound on the quality of the solution. We introduce a transformation that uses the closed form to identify and eliminate bottlenecks. We show experimentally that state-of-the art integer linear programming approaches for orchestrating stream graphs are (1) intractable or at least impractical for larger stream graphs and larger number of processors and (2) our 2-approximation algorithm is highly efficient and its results are close to the optimal solution for a standard set of StreamIt benchmark programs.

Original languageEnglish
Pages (from-to)357-367
Number of pages11
JournalACM SIGPLAN Notices
Volume47
Issue number4
DOIs
Publication statusPublished - 2012 Jun 1

Fingerprint

Approximation algorithms
Data transfer rates
Combinatorial optimization
Linear programming
Transfer functions
Throughput

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Farhad, S. M. ; Ko, Yousun ; Burgstaller, bernd ; Scholz, Bernhard. / Orchestration by approximation mapping stream programs onto multicore architectures. In: ACM SIGPLAN Notices. 2012 ; Vol. 47, No. 4. pp. 357-367.
@article{952c9da3585544a1ad46e7bd63176208,
title = "Orchestration by approximation mapping stream programs onto multicore architectures",
abstract = "We present a novel 2-approximation algorithm for deploying stream graphs on multicore computers and a stream graph transformation that eliminates bottlenecks. The key technical insight is a data rate transfer model that enables the computation of a {"}closed form{"}, i.e., the data rate transfer function of an actor depending on the arrival rate of the stream program. A combinatorial optimization problem uses the closed form to maximize the throughput of the stream program. Although the problem is inherently NP-hard, we present an efficient and effective 2-approximation algorithm that provides a lower bound on the quality of the solution. We introduce a transformation that uses the closed form to identify and eliminate bottlenecks. We show experimentally that state-of-the art integer linear programming approaches for orchestrating stream graphs are (1) intractable or at least impractical for larger stream graphs and larger number of processors and (2) our 2-approximation algorithm is highly efficient and its results are close to the optimal solution for a standard set of StreamIt benchmark programs.",
author = "Farhad, {S. M.} and Yousun Ko and bernd Burgstaller and Bernhard Scholz",
year = "2012",
month = "6",
day = "1",
doi = "10.1145/2248487.1950406",
language = "English",
volume = "47",
pages = "357--367",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

Orchestration by approximation mapping stream programs onto multicore architectures. / Farhad, S. M.; Ko, Yousun; Burgstaller, bernd; Scholz, Bernhard.

In: ACM SIGPLAN Notices, Vol. 47, No. 4, 01.06.2012, p. 357-367.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Orchestration by approximation mapping stream programs onto multicore architectures

AU - Farhad, S. M.

AU - Ko, Yousun

AU - Burgstaller, bernd

AU - Scholz, Bernhard

PY - 2012/6/1

Y1 - 2012/6/1

N2 - We present a novel 2-approximation algorithm for deploying stream graphs on multicore computers and a stream graph transformation that eliminates bottlenecks. The key technical insight is a data rate transfer model that enables the computation of a "closed form", i.e., the data rate transfer function of an actor depending on the arrival rate of the stream program. A combinatorial optimization problem uses the closed form to maximize the throughput of the stream program. Although the problem is inherently NP-hard, we present an efficient and effective 2-approximation algorithm that provides a lower bound on the quality of the solution. We introduce a transformation that uses the closed form to identify and eliminate bottlenecks. We show experimentally that state-of-the art integer linear programming approaches for orchestrating stream graphs are (1) intractable or at least impractical for larger stream graphs and larger number of processors and (2) our 2-approximation algorithm is highly efficient and its results are close to the optimal solution for a standard set of StreamIt benchmark programs.

AB - We present a novel 2-approximation algorithm for deploying stream graphs on multicore computers and a stream graph transformation that eliminates bottlenecks. The key technical insight is a data rate transfer model that enables the computation of a "closed form", i.e., the data rate transfer function of an actor depending on the arrival rate of the stream program. A combinatorial optimization problem uses the closed form to maximize the throughput of the stream program. Although the problem is inherently NP-hard, we present an efficient and effective 2-approximation algorithm that provides a lower bound on the quality of the solution. We introduce a transformation that uses the closed form to identify and eliminate bottlenecks. We show experimentally that state-of-the art integer linear programming approaches for orchestrating stream graphs are (1) intractable or at least impractical for larger stream graphs and larger number of processors and (2) our 2-approximation algorithm is highly efficient and its results are close to the optimal solution for a standard set of StreamIt benchmark programs.

UR - http://www.scopus.com/inward/record.url?scp=84863833341&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863833341&partnerID=8YFLogxK

U2 - 10.1145/2248487.1950406

DO - 10.1145/2248487.1950406

M3 - Article

VL - 47

SP - 357

EP - 367

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 4

ER -