ACM Home Page
Please provide us with feedback. Feedback
From the heroic to the logistical: programming model implications of new supercomputing applications
Full text PdfPdf (138 KB)
Source
International Workshop on Challenges of Large Applications in Distributed Environments archive
Proceedings of the 6th international workshop on Challenges of large applications in distributed environments table of contents
Boston, MA, USA
SESSION: Lessons and visions table of contents
Pages 57-58  
Year of Publication: 2008
ISBN:978-1-60558-156-9
Author
Ian Foster  Argonne National Laboratory & University of Chicago, Chicago, IL, USA
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

abstract   index terms  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1383529.1383541
What is a DOI?

ABSTRACT

High-performance computers such as the petascale systems being installed at DOE and NSF centers in the US are conventionally focused on "heroic" computations in which many processors are applied to a single task. Yet a growing number of science applications are equally concerned with "logistical" issues: that is, with the high-performance and reliable execution of many tasks that operate on large shared data and/or are linked by communication-intensive producer-consumer relations. Such applications may require the extreme computational capacity and specialized communication fabrics of petascale computers, but are not easily expressed using conventional parallel programming models such as MPI. To enable the use of high-performance computers for these applications, we need new methods for the efficient dispatch, coupling, and management of large numbers of communication-intensive tasks. I discuss how work on scripting languages, high-throughput computing, and parallel I/O can be combined to build new tools that enable the efficient and reliable execution of applications involving from hundreds to millions of uniprocessor and multiprocessor tasks, with aggregate communication requirements of tens of gigabytes per second. I illustrate my presentation by referring to our experiences adapting the Swift parallel programming system (www.ci.uchicago.edu/swift) for efficient execution in both large-scale grid and petascale cluster environments.