Stencils and problem partitionings: Their influence on the performance of multiple processor systems

Journal Article · Wed Jul 01 04:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676980· OSTI ID:5606635

Reed, D A; Adams, L M; Patrick, M L

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. The authors 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. Their partitioning technique uses the stencil structure to select appropriate partition shapes. For square problem domains, they show that nonstandard partitions (e.g., hexagons) are frequently preferable to the standard square partitions for a variety of commonly used stencils. They 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.

• Research Organization: Dept. of Computer Science, Univ. of Illinois, Urbana, IL 61801
• OSTI ID: 5606635
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:7; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER CODES
DATA
DIFFERENTIAL EQUATIONS
ELECTRONIC CIRCUITS
EQUATIONS
EQUIPMENT INTERFACES
EXECUTIVE CODES
INFORMATION
INTEGRATED CIRCUITS
MEMORY DEVICES
MICROELECTRONIC CIRCUITS
NUMERICAL SOLUTION
OPTIMIZATION
PARALLEL PROCESSING
PARTIAL DIFFERENTIAL EQUATIONS
PERFORMANCE
PROGRAMMING
SHAPE