ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Implementing the beam and warming method on the hypercube
Full text PdfPdf (708 KB)
Source Hypercube Concurrent Computers and Applications archive
Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 table of contents
Pasadena, California, United States
Pages: 1073 - 1087  
Year of Publication: 1989
ISBN:0-89791-278-0
Authors
J. Bruno  Department of Computer Science, University of California, Santa Barbara, CA
P. R. Cappello  Department of Computer Science, University of California, Santa Barbara, CA
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 27,   Citation Count: 4
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Numerical simulation of a wide range of physical phenomena typically involves enormous amounts of computation and, for scores of practical problems, these simulations cannot be carried out even on today's fastest supercomputers. The economic and scientific importance of many of these problems is driving the explosive research in computer architecture, especially the work aimed at achieving ultra high-speed computation by exploiting concurrent processing. Correspondingly, there is great interest in the design and analysis of numerical algorithms which are suitable for implementation on concurrent processor systems. In this paper we consider the implementation of the Beam and Warming implicit factored method on a hypercube concurrent processor system. We present a set of equations and give the numerical method in sufficient detail to illustrate and analyze the problems which arise in implementing this numerical method. We show that there are mappings of the computational domain onto the nodes of a hypercube concurrent processor system which maintain the efficiency of the numerical method. We also show that better methods do not exist.



Collaborative Colleagues:
J. Bruno: colleagues
P. R. Cappello: colleagues