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

Aykanat, Cevdet; Cambazoğlu, B. Barla; Uçar, Bora

doi:10.1016/j.jpdc.2007.09.006

Cited by 72 publications

(100 citation statements)

References 42 publications

Supporting

Mentioning

100

Contrasting

Order By: Relevance

“…RB is the most commonly used method for obtaining a K -way partition of a hypergraph, although there are other methods based on direct K -way partitioning [3,27]. In the RB scheme, first a bipartition of the initial hypergraph is obtained, and then this bipartition is decoded to construct two subhypergraphs using the cut-net removal and cut-net splitting techniques [2] to capture the cut-net and connectivity cutsize metrics, respectively.…”

Section: Recursive Bipartitioning and Multilevel Frameworkmentioning

confidence: 99%

“…FM-based heuristics perform poorly on hypergraphs with high net degrees [3,27] and small vertex degrees [19]. To alleviate these problems, multilevel algorithms have been proposed [6,20] and applied to the HP problem, leading to successful HP tools such as PaToH [2], hMeTiS [26], Mondriaan [45], Zoltan [14], and ParKWay [43].…”

Section: Recursive Bipartitioning and Multilevel Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Replicated partitioning for undirected hypergraphs

Selvitopi

Türk

Aykanat

2012

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

a b s t r a c tHypergraph partitioning (HP) and replication are diverse but powerful tools that are traditionally applied separately to minimize the costs of parallel and sequential systems that access related data or process related tasks. When combined together, these two techniques have the potential of achieving significant improvements in performance of many applications. In this study, we provide an approach involving a tool that simultaneously performs replication and partitioning of the vertices of an undirected hypergraph whose vertices represent data and nets represent task dependencies among these data. In this approach, we propose an iterative-improvement-based replicated bipartitioning heuristic, which is capable of move, replication, and unreplication of vertices. In order to utilize our replicated bipartitioning heuristic in a recursive bipartitioning framework, we also propose appropriate cut-net removal, cut-net splitting, and pin selection algorithms to correctly encapsulate the two most commonly used cutsize metrics. We embed our replicated bipartitioning scheme into the state-of-the-art multilevel HP tool PaToH to provide an effective and efficient replicated HP tool, rpPaToH. The performance of the techniques proposed and the tools developed is tested over the undirected hypergraphs that model the communication costs of parallel query processing in information retrieval systems. Our experimental analysis indicates that the proposed technique provides significant improvements in the quality of the partitions, especially under low replication ratios.

show abstract

Section: Recursive Bipartitioning and Multilevel Frameworkmentioning

confidence: 99%

Section: Recursive Bipartitioning and Multilevel Frameworkmentioning

confidence: 99%

Replicated partitioning for undirected hypergraphs

Selvitopi

Türk

Aykanat

2012

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…A recent variant of the above problem is the multi-constraint hypergraph partitioning [4,[17][18][19][20] in which each vertex has a vector of weights associated with it. The partitioning objective is the same as above, and the partitioning constraint is to satisfy a balance criterion associated with each weight.…”

Section: Hypergraphs and Hypergraph Partitioningmentioning

confidence: 99%

“…The multilevel paradigm [21] has been successfully applied to hypergraph partitioning [2,17,19,22]. A multilevel hypergraph partitioning method consists of three phases: coarsening, initial partitioning and uncoarsening.…”

Section: Hypergraphs and Hypergraph Partitioningmentioning

confidence: 99%

A Matrix Partitioning Interface to PaToH in MATLAB

2010

Self Cite

View full text Add to dashboard Cite

We present the PaToH MATLAB Matrix Partitioning Interface. The interface provides support for hypergraph-based sparse matrix partitioning methods which are used for efficient parallelization of sparse matrix-vector multiplication operations. The interface also offers tools for visualizing and measuring the quality of a given matrix partition. We propose a novel, multilevel, 2D coarsening-based 2D matrix partitioning method and implement it using the interface. We have performed extensive comparison of the proposed method against our implementation of orthogonal recursive bisection and fine-grain methods on a large set of publicly available test matrices. The conclusion of the experiments is that the new method can compete with the fine-grain method while also suggesting new research directions.

show abstract

“…Although direct K-way hypergraph partitioning [4] is feasible, the Recursive Bipartitioning (RB) paradigm is widely used in K-way hypergraph partitioning and known to be amenable to produce good solution qualities. This paradigm is especially suitable for partitioning hypergraphs when K is not known in advance.…”

Section: Hypergraph Partitioningmentioning

confidence: 99%

A link-based storage scheme for efficient aggregate query processing on clustered road networks

Demir

Aykanat

Cambazoğlu

2010

Information Systems

Self Cite

View full text Add to dashboard Cite

a b s t r a c tThe need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that the road network is stored in a central server, the adjacent data elements in the network must be clustered on the disk in such a way that the number of disk page accesses is kept minimal during the processing of network queries. In this work, we introduce the link-based storage scheme for clustered road networks and compare it with the previously proposed junctionbased storage scheme. In order to investigate the performance of aggregate network queries in clustered road networks, we extend our recently proposed clustering hypergraph model from junction-based storage to link-based storage. We propose techniques for additional storage savings in bidirectional networks that make the linkbased storage scheme even more preferable in terms of the storage efficiency. We evaluate the performance of our link-based storage scheme against the junction-based storage scheme both theoretically and empirically. The results of the experiments conducted on a wide range of road network datasets show that the link-based storage scheme is preferable in terms of both storage and query processing efficiency.

show abstract

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

Cited by 72 publications

References 42 publications

Replicated partitioning for undirected hypergraphs

Replicated partitioning for undirected hypergraphs

A Matrix Partitioning Interface to PaToH in MATLAB

A link-based storage scheme for efficient aggregate query processing on clustered road networks

Contact Info

Product

Resources

About