This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
D.A. Reed, Department of Computer Science, University of Illinois
Given a discretization stencil, partitioning the problem domain is an important first step for the efficient solution of partial differential equations on multiple processor systems. We derive partitions that minimize interprocessor communication when the number of processors is known a priori and each domain partition is assigned to a different processor. Our partitioning technique uses the stencil structure to select appropriate partition shapes. For square problem domains, we show that nonstandard partitions (e.g., hexagons) are frequently preferable to the standard square partitions for a variety of commonly used stencils. We conclude with a formalization of the relationship between partition shape, stencil structure, and architecture, allowing selection of optimal partitions for a variety of parallel systems.
Index Terms:
shared memory multiprocessor, Communication analysis, hypercube multiprocessor, partial differential equations, performance modeling
Citation:
D.A. Reed, L.M. Adams, M.L. Patrick, "Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor Systems," IEEE Transactions on Computers, vol. 36, no. 7, pp. 845-858, July 1987, doi:10.1109/TC.1987.1676980
Usage of this product signifies your acceptance of the Terms of Use.