Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

CiteULike is a free service for managing and discovering scholarly references - click here to get started.

Sign In to gain access to subscriptions and/or personal tools.
International Journal of High Performance Computing Applications
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Web of Science (7)
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Adve, V.
Right arrow Articles by Sakellariou, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Application Representations for Multiparadigm Performance Modeling of Large-Scale Parallel Scientific Codes

Vikram Adve

Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois

Rizos Sakellariou

Department of Computer Science, University of Manchester, United Kingdom

Effective performance prediction for large parallel applications on very large-scale systems requires a comprehensive modeling approach that combines analytical models, simulation models, and measurement for different application and system components. This paper presents a common parallel program representation, designed to support such a comprehensive approach, with four design goals: (1) the representation must support a wide range of modeling techniques; (2) it must be automatically computable using parallelizing compiler technology, in order to minimize the need for user intervention; (3) it must be efficient and scalable enough to model teraflop-scale applications; and (4) it should be flexible enough to capture the performance impact of changes to the application, including changes to the parallelization strategy, communication, and scheduling. The representation we present is based on a combination of static and dynamic task graphs. It exploits recent compiler advances that make it possible to use concise, symbolic static graphs and to instantiate dynamic graphs. This representation has led to the development of a compiler-supported simulation approach that can simulate regular, message-passing programs on systems or problems 10 to 100 times larger than was possible with previous state-of-the-art simulation techniques.

International Journal of High Performance Computing Applications, Vol. 14, No. 4, 304-316 (2000)
DOI: 10.1177/109434200001400403
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?