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 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 Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Cortese, T. A.
Right arrow Articles by Balachandar, S.
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?

High Performance Spectral Simulation of Turbulent Flows in Massively Parallel Machines With Distributed Memory

Thomas A. Cortese

DEPARTMENT OF THEORETICAL AND APPLIED MECHANICS UNIVERSITY OF ILLINOIS, URBANA, ILLINOIS

S. Balachandar

DEPARTMENT OF THEORETICAL AND APPLIED MECHANICS UNIVERSITY OF ILLINOIS, URBANA, ILLINOIS

Here we have demonstrated the possibility of very high performance in the implementation of a global spectral methodology on a massively parallel architec ture with distributed memory. Spectral simulations of channel flow and thermal convection in a three-dimen sional Cartesian geometry have yielded a very high performance—up to 26 Gflops/s on a 512-node CM5. In general, implementation of spectral methodology in parallel processors with distributed memory requires nonlocal interprocessor data transfer that is not re stricted to being between nearest neighbors. In spite of their increased communication overhead, better per formance is possible in global methodologies owing to their dense matrix operations and organized data com munication. In this paper we outline a general method ology for the data-parallel implementation of spectral methods on massively parallel machines with distrib uted memory. Following the steps presented here, very high performance can be obtained on a wide vari ety of massively parallel architectures.

International Journal of High Performance Computing Applications, Vol. 9, No. 3, 187-204 (1995)
DOI: 10.1177/109434209500900302
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?