November 4, 2002
Conference Paper

Efficient Algorithms for Ghost Cell Updates on Two Classes of MPP Architectures

Abstract

Introduction Calculations on logically regular grids are common in many areas of numerical simulation and engineering. Increases in computer speed have led to corresponding increases in the accuracy and range of application of these calculations; however, the trend toward parallel computers has made realizing these gains in speed and problem size increasingly difficult. For large problems, the data must be apportioned between the allocated processors. Most algorithms require that in order to update an element at the edge of a subdomain residing on a particular processor, fresh data from neighboring processors is need

Revised: September 7, 2007 | Published: November 4, 2002

Citation

Palmer B.J., and J. Nieplocha. 2002. Efficient Algorithms for Ghost Cell Updates on Two Classes of MPP Architectures. In Proceedings of the 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002), November 4-6, 2006, Cambridge, Massachusetts, edited by S. G. Akl and T. Gonzalez, 197-202. Anaheim, California:ACTA Press. PNNL-SA-40882.