Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Scalable Workflow Enactment Engines and Technology
Article type: Research Article
Authors: Wozniak, Justin M. | Armstrong, Timothy G. | Maheshwari, Ketan | Lusk, Ewing L. | Katz, Daniel S. | Wilde, Michael | Foster, Ian T.
Affiliations: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA. wozniak@mcs.anl.gov | Computer Science Department, University of Chicago, Chicago, IL USA. tga@uchicago.edu | Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA. ketan@mcs.anl.gov | Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA. lusk@mcs.anl.gov | Computation Institute, University of Chicago & Argonne National Laboratory, Chicago, IL USA. d.katz@ieee.org | Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA. wilde@mcs.anl.gov | Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA. foster@mcs.anl.gov
Note: [] Address for correspondence: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL USA
Abstract: Efficiently utilizing the rapidly increasing concurrency of multi-petaflop computing systems is a significant programming challenge. One approach is to structure applications with an upper layer of many loosely coupled coarse-grained tasks, each comprising a tightly-coupled parallel function or program. “Many-task” programming models such as functional parallel dataflow may be used at the upper layer to generate massive numbers of tasks, each of which generates significant tightly coupled parallelism at the lower level through multithreading, message passing, and/or partitioned global address spaces. At large scales, however, the management of task distribution, data dependencies, and intertask data movement is a significant performance challenge. In this work, we describe Turbine, a new highly scalable and distributed many-task dataflow engine. Turbine executes a generalized many-task intermediate representation with automated self-distribution and is scalable to multi-petaflop infrastructures. We present here the architecture of Turbine and its performance on highly concurrent systems.
Keywords: dataflow language, Swift, ADLB, MPI, Turbine
DOI: 10.3233/FI-2013-949
Journal: Fundamenta Informaticae, vol. 128, no. 3, pp. 337-366, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl