On partitioning problems with complex objectives - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

On partitioning problems with complex objectives

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.
No file

Dates and versions

hal-00763548 , version 1 (11-12-2012)

Identifiers

Cite

Kamer Kaya, François-Henry Rouet, Bora Uçar. On partitioning problems with complex objectives. Parallel Processing Workshops (Euro-Par 2011), Aug 2011, Bordeaux, France. pp.334-344, ⟨10.1007/978-3-642-29737-3_38⟩. ⟨hal-00763548⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More