A partitioning strategy for nonuniform problems on multiprocessors

Journal Article · Fri May 01 00:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676942· OSTI ID:6505964

Berger, M J; Bokhari, S H

The authors consider the partitioning of a problem on a domain with unequal work estimates in different subdomains in a way that balances the workload across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. They use a binary decomposition of the domain to partition it into rectangles requiring equal computational effort. They then study the communication costs of mapping this partitioning onto different multiprocessors: a mesh connected array, a tree machine, and a hypercube. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

• Research Organization: Courant Institute of Mathematical Sciences, New York Univ., New York, NY 10012
• OSTI ID: 6505964
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:5; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990230 -- Mathematics & Mathematical Models-- (1987-1989)
ARRAY PROCESSORS
COMMUNICATIONS
DATA PROCESSING
DATA TRANSMISSION
DIFFERENTIAL EQUATIONS
DISTRIBUTED DATA PROCESSING
EQUATIONS
MAPPING
OPTIMIZATION
PARALLEL PROCESSING
PARTIAL DIFFERENTIAL EQUATIONS
PLANNING
PROCESSING
PROGRAMMING