This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
May 1987 (vol. 36 no. 5)
pp. 570-580
M.J. Berger, Courant Institute of Mathematical Sciences, New York University
We 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. We use a binary decomposition of the domain to partition it into rectangles requiring equal computational effort. We 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.
Index Terms:
pde's, Binary decomposition, domain decomposition, load balancing, mapping problem, multiprocessing, partitioning
Citation:
M.J. Berger, S.H. Bokhari, "A Partitioning Strategy for Nonuniform Problems on Multiprocessors," IEEE Transactions on Computers, vol. 36, no. 5, pp. 570-580, May 1987, doi:10.1109/TC.1987.1676942
Usage of this product signifies your acceptance of the Terms of Use.