### 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 work load 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 to partition it into rectangles requiring equal computational effort is used. The communication costs of mapping this partitioning onto a tree machine and a mesh-connected array are analyzed. The communication cost can be used to determine the optimal depth of this partitioning.

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

Title of host publication | Proceedings of the International Conference on Parallel Processing |

Editors | Douglas DeGroot |

Publisher | IEEE |

Pages | 166-170 |

Number of pages | 5 |

ISBN (Print) | 0818606371 |

State | Published - 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Proceedings of the International Conference on Parallel Processing*(pp. 166-170). IEEE.

**PARTITIONING STRATEGY FOR PDES ACROSS MULTIPROCESSORS.** / Berger, Marsha; Bokhari, Shahid H.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the International Conference on Parallel Processing.*IEEE, pp. 166-170.

}

TY - GEN

T1 - PARTITIONING STRATEGY FOR PDES ACROSS MULTIPROCESSORS.

AU - Berger, Marsha

AU - Bokhari, Shahid H.

PY - 1985

Y1 - 1985

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 work load 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 to partition it into rectangles requiring equal computational effort is used. The communication costs of mapping this partitioning onto a tree machine and a mesh-connected array are analyzed. The communication cost can be used to determine the optimal depth of this 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 work load 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 to partition it into rectangles requiring equal computational effort is used. The communication costs of mapping this partitioning onto a tree machine and a mesh-connected array are analyzed. The communication cost can be used to determine the optimal depth of this partitioning.

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

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

M3 - Conference contribution

AN - SCOPUS:0022185145

SN - 0818606371

SP - 166

EP - 170

BT - Proceedings of the International Conference on Parallel Processing

A2 - DeGroot, Douglas

PB - IEEE

ER -