Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

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 Deshpande, M.
Right arrow Articles by Deshpande, A.
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 of a Distribute d nEtwork in Computational Fluid Dynamic Simulations

Manish Deshpande

PROPULSION ENGINEERING RESEARCH CENTER DEPARTMENT OF MECHANICAL ENGINEERING THE PENNSYLVANIA STATE UNIVERSITY UNIVERSITY PARK, PENNSYLVANIA

Jinzhang Feng

PROPULSION ENGINEERING RESEARCH CENTER DEPARTMENT OF MECHANICAL ENGINEERING THE PENNSYLVANIA STATE UNIVERSITY UNIVERSITY PARK, PENNSYLVANIA

Charles L. Merkle

PROPULSION ENGINEERING RESEARCH CENTER DEPARTMENT OF MECHANICAL ENGINEERING THE PENNSYLVANIA STATE UNIVERSITY UNIVERSITY PARK, PENNSYLVANIA

Ashish Deshpande

DEPARTMENT OF COMPUTER SCIENCE YALE UNIVERSITY NEW HAVEN, CONNECTICUT

A general-purpose 3-D, incompressible Navier-Stokes algorithm is implemented on a network of concur rently operating workstations using PVM and com pared with its performance on a CRAY Y-MP and on an Intel iPSC/860. The problem is relatively computa tionally intensive, and has a communication structure based primarily on nearest-neighbor communication, making it ideally suited to message passing. Such problems are frequently encountered in CFD, and their solution is increasingly in demand. The communica tion structure is explicitly coded in the implementation to fully exploit the regularity in message passing in order to produce a near-optimal solution. Results are presented for various grid sizes using up to eight pro cessors.

International Journal of High Performance Computing Applications, Vol. 8, No. 1, 64-67 (1994)
DOI: 10.1177/109434209400800108
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?