PARTITIONING STRATEGY FOR PDES ACROSS MULTIPROCESSORS.

Marsha J. Berger, Shahid H. Bokhari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsDouglas DeGroot
PublisherIEEE
Pages166-170
Number of pages5
ISBN (Print)0818606371
StatePublished - 1985

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'PARTITIONING STRATEGY FOR PDES ACROSS MULTIPROCESSORS.'. Together they form a unique fingerprint.

Cite this