Parallel and Distributed Processing Symposium, International (2001)

San Francisco, California, USA

Apr. 23, 2001 to Apr. 27, 2001

ISSN: 1530-2075

ISBN: 0-7695-0990-8

pp: 30121

ABSTRACT

Graph partitioning is an important tool for dividing work amongst processors of a parallel machine, but it is unsuitable for some important applications. Specifically, graph partitioning requires the work per processor to be a simple sum of vertex weights. For many applications, this assumption is not true - the work (or memory) is a complex function of the partition. In this paper we describe a general framework for addressing such partitioning problems and investigate its utility on two applications -partitioning so that overlapped subdomains are balanced and partitioning to minimize the sum of computation plus communication time.

INDEX TERMS

null

CITATION

Ali Pinar,
Bruce Hendrickson,
"Partitioning for Complex Objectives",

*Parallel and Distributed Processing Symposium, International*, vol. 03, no. , pp. 30121, 2001, doi:10.1109/IPDPS.2001.925098