On partitioning problems with complex objectives

Authors:
Kamer Kaya;François-Henry Rouet;Bora Uçar
Affiliations:
CERFACS, Toulouse, France;Université de Toulouse, INPT (ENSEEIHT)-IRIT, France;CNRS and ENS Lyon, France
Venue:
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
Year:
2011

Citing 11
Cited 1

Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Multiple-Way Network Partitioning with Different Cost Functions

IEEE Transactions on Computers
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing

SIAM Journal on Scientific Computing
Partitioning for Complex Objectives

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning (Distinguished Paper)

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies

SIAM Journal on Scientific Computing
Permuting Sparse Rectangular Matrices into Block-Diagonal Form

SIAM Journal on Scientific Computing
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication

SIAM Review
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

Journal of Parallel and Distributed Computing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe

SIAM Journal on Scientific Computing

A new metric enabling an exact hypergraph model for the communication volume in distributed-memory parallel applications

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypergraph and graph partitioning tools are used to partition work for efficient parallelization of many sparse matrix computations. Most of the time, the objective function that is reduced by these tools relates to reducing the communication requirements, and the balancing constraints satisfied by these tools relate to balancing the work or memory requirements. Sometimes, the objective sought for having balance is a complex function of a partition. We mention some important class of parallel sparse matrix computations that have such balance objectives. For these cases, the current state of the art partitioning tools fall short of being adequate. To the best of our knowledge, there is only a single algorithmic framework in the literature to address such balance objectives. We propose another algorithmic framework to tackle complex objectives and experimentally investigate the proposed framework.