Design and evaluation of a collective IO model for loosely coupled petascale programming Export

@inproceedings{citeulike:4068922, abstract = {Loosely coupled programming is a powerful paradigm for rapidly creating higher-level applications from scientific programs on petascale systems, typically using scripting languages. This paradigm is a form of many-task computing (MTC) which focuses on the passing of data between programs as ordinary files rather than messages. While it has the significant benefits of decoupling producer and consumer and allowing existing application programs to be executed in parallel with no recoding, its typical implementation using shared file systems places a high performance burden on the overall system and on the user who will analyze and consume the downstream data. Previous efforts have achieved great speedups with loosely coupled programs, but have done so with careful manual tuning of all shared file system access. In this work, we evaluate a prototype collective IO model for file-based MTC. The model enables efficient and easy distribution of input data files to computing nodes and gathering of output results from them. It eliminates the need for such manual tuning and makes the programming of large-scale clusters using a loosely coupled model easier. Our approach, inspired by in-memory approaches to collective operations for parallel programming, builds on fast local file systems to provide high-speed local file caches for parallel scripts, uses a broadcast approach to handle distribution of common input data, and uses efficient scatter/gather and caching techniques for input and output. We describe the design of the prototype model, its implementation on the Blue Gene/P supercomputer, and present preliminary measurements of its performance on synthetic benchmarks and on a large-scale molecular dynamics application.}, author = {Zhang, Zhao and Espinosa, A. and Iskra, K. and Raicu, I. and Foster, I. and Wilde, M.}, booktitle = {Many-Task Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on}, citeulike-article-id = {4068922}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/MTAGS.2008.4777908}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4777908}, citeulike-linkout-2 = {http://arxiv.org/pdf/0901.0134}, citeulike-linkout-3 = {http://arxiv.org/abs/0901.0134}, day = {06}, doi = {10.1109/MTAGS.2008.4777908}, journal = {Many-Task Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on}, keywords = {supercomputing}, month = {February}, pages = {1--10}, posted-at = {2009-02-18 21:43:06}, priority = {2}, title = {Design and evaluation of a collective IO model for loosely coupled petascale programming}, url = {http://dx.doi.org/10.1109/MTAGS.2008.4777908}, year = {2009} }

TY - CONF ID - citeulike:4068922 L3 - citeulike-article-id:4068922 N2 - Loosely coupled programming is a powerful paradigm for rapidly creating higher-level applications from scientific programs on petascale systems, typically using scripting languages. This paradigm is a form of many-task computing (MTC) which focuses on the passing of data between programs as ordinary files rather than messages. While it has the significant benefits of decoupling producer and consumer and allowing existing application programs to be executed in parallel with no recoding, its typical implementation using shared file systems places a high performance burden on the overall system and on the user who will analyze and consume the downstream data. Previous efforts have achieved great speedups with loosely coupled programs, but have done so with careful manual tuning of all shared file system access. In this work, we evaluate a prototype collective IO model for file-based MTC. The model enables efficient and easy distribution of input data files to computing nodes and gathering of output results from them. It eliminates the need for such manual tuning and makes the programming of large-scale clusters using a loosely coupled model easier. Our approach, inspired by in-memory approaches to collective operations for parallel programming, builds on fast local file systems to provide high-speed local file caches for parallel scripts, uses a broadcast approach to handle distribution of common input data, and uses efficient scatter/gather and caching techniques for input and output. We describe the design of the prototype model, its implementation on the Blue Gene/P supercomputer, and present preliminary measurements of its performance on synthetic benchmarks and on a large-scale molecular dynamics application. JF - Many-Task Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on EP - 10 TI - Design and evaluation of a collective IO model for loosely coupled petascale programming T2 - Many-Task Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on SP - 1 KW - supercomputing AU - Zhang, Zhao AU - Espinosa, A AU - Iskra, K AU - Raicu, I AU - Foster, I AU - Wilde, M PY - 2009/02/06/ UR - http://dx.doi.org/10.1109/MTAGS.2008.4777908 ER -