Thumbnail
Access Restriction
Subscribed

Author Benoit, Anne ♦ atalyrek, mit V. ♦ Robert, Yves ♦ Saule, Erik
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2013
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Workflow programming ♦ Algorithms ♦ Distributed systems ♦ Filter-stream programming ♦ Latency ♦ Models ♦ Parallel systems ♦ Pipeline ♦ Scheduling ♦ Throughput
Abstract A large class of applications need to execute the same workflow on different datasets of identical size. Efficient execution of such applications necessitates intelligent distribution of the application components and tasks on a parallel machine, and the execution can be orchestrated by utilizing task, data, pipelined, and/or replicated parallelism. The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and it has been widely studied in the last decade. Multiple models and algorithms have flourished to tackle various programming paradigms, constraints, machine behaviors, or optimization goals. This article surveys the field by summing up and structuring known results and approaches.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2013-08-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 45
Issue Number 4
Page Count 36
Starting Page 1
Ending Page 36


Open content in new tab

   Open content in new tab
Source: ACM Digital Library