### Abstract

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. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication cost of mapping this partitioning onto different multiprocessors - is a mesh-connected array, a tree machine, and a hypercube - is then studied. The communication-cost expressions can be used to determine the optimal depth of the partitioning.

Original language | English (US) |
---|---|

Pages (from-to) | 570-580 |

Number of pages | 11 |

Journal | IEEE Transactions on Computers |

Volume | C-36 |

Issue number | 5 |

State | Published - May 1987 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*IEEE Transactions on Computers*,

*C-36*(5), 570-580.

**PARTITIONING STRATEGY FOR NONUNIFORM PROBLEMS ON MULTIPROCESSORS.** / Berger, Marsha; Bokhari, Shahid H.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. C-36, no. 5, pp. 570-580.

}

TY - JOUR

T1 - PARTITIONING STRATEGY FOR NONUNIFORM PROBLEMS ON MULTIPROCESSORS.

AU - Berger, Marsha

AU - Bokhari, Shahid H.

PY - 1987/5

Y1 - 1987/5

N2 - 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. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication cost of mapping this partitioning onto different multiprocessors - is a mesh-connected array, a tree machine, and a hypercube - is then studied. The communication-cost expressions can be used to determine the optimal depth of the partitioning.

AB - 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. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication cost of mapping this partitioning onto different multiprocessors - is a mesh-connected array, a tree machine, and a hypercube - is then studied. The communication-cost expressions can be used to determine the optimal depth of the partitioning.

UR - http://www.scopus.com/inward/record.url?scp=0023346636&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023346636&partnerID=8YFLogxK

M3 - Article

VL - C-36

SP - 570

EP - 580

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 5

ER -