Book Chapter10.1007/978-3-319-49178-3_36
A Distributed Algorithm for Balanced Hypergraph Partitioning
Wenyin Yang,Wenyin Yang,Guojun Wang,Li Ma,Shiyang Wu +4 more
- 16 Nov 2016
- pp 477-490
12
TL;DR: This paper proposes a distributed hyperedge partition algorithm, HyperSwap, to partition the hypergraph into balanced sub-hypergraph as required, without global information and central coordination, and shows the feasibility, evaluate it on Facebook dataset with various settings, and compare it against two alternative solutions.
read more
Abstract: Hypergraph is good at modeling multi-node relationships in complex networks. Balanced hypergraph partitioning helps to optimize storage of large sets of hypergraph-structured data over multi-hosts in the Cloud, and share the query loads. Several centralized vertex partitioning algorithms have been developed to address this problem. However, edge partitioning is proved more effective than vertex partitioning for graph processing. Aim of this paper is to explore a new approach based on hyperedge partitioning, in which hyperedges, rather than vertices, are partitioned into disjoint subsets. We propose a distributed hyperedge partition algorithm, HyperSwap, to partition the hypergraph into balanced sub-hypergraph as required, without global information and central coordination. We show the feasibility, evaluate it on Facebook dataset with various settings, and compare it against two alternative solutions. Experiment findings show that HyperSwap outperforms the other two partitioners because it obtains good partitions with low cut cost while conforming to any balance requirement.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
High-Quality Hypergraph Partitioning
Sebastian Schlag,Tobias Heuer,Lars Gottesbüren,Yaroslav Akhremtsev,Christian Schulz,Peter Sanders +5 more
TL;DR: KaHyPar, already without the memetic component, computes better solutions than all competing algorithms for both the cut-net and the connectivity metric, while being faster than Zoltan-AlgD and equally fast as hMETIS.
Social hash partitioner: a scalable distributed hypergraph partitioner
Igor Kabiljo,Brian Karrer,Mayank Pundir,Sergey Pupyrev,Alon Shalita +4 more
- 01 Aug 2017
TL;DR: The Social Hash Partitioner as mentioned in this paper is a distributed algorithm for balanced k-way hypergraph partitioning that minimizes fanout, a fundamental hypergraph quantity also known as the communication volume and (k - 1)-cut metric, by optimizing a novel objective called probabilistic fanout.
•Posted Content
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner
Igor Kabiljo,Brian Karrer,Mayank Pundir,Sergey Pupyrev,Alon Shalita,Alessandro Presta,Yaroslav Akhremtsev +6 more
TL;DR: A distributed algorithm for balanced k-way hypergraph partitioning that minimizes fanout, a fundamental hypergraph quantity also known as the communication volume and (k - 1)-cut metric, by optimizing a novel objective called probabilistic fanout is designed and implemented.
29
Advances in Services Computing
Guojun Wang,Yanbo Han,Gregorio Martínez Pérez +2 more
- 01 Jan 2016
TL;DR: In recent years, smartphone-based human activity recognition has become a promising research field of mobile computing, and is widely applied in inertial positioning, fall detection, and personalized recommendation.
19
BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitioner.
TL;DR: BiPart as mentioned in this paper is the first deterministic, parallel hypergraph partitioner, which uses parallelism to speed up the parallelization of VLSI design, linear algebra, Boolean satisfiability, and data mining.
14
References
A Linear-Time Heuristic for Improving Network Partitions
Charles M. Fiduccia,R. M. Mattheyses +1 more
- 01 Jan 1982
TL;DR: An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network.
2.5K
PowerGraph: distributed graph-parallel computation on natural graphs
Joseph E. Gonzalez,Yucheng Low,Haijie Gu,Danny Bickson,Carlos Guestrin +4 more
- 08 Oct 2012
TL;DR: This paper describes the challenges of computation on natural graphs in the context of existing graph-parallel abstractions and introduces the PowerGraph abstraction which exploits the internal structure of graph programs to address these challenges.
Multilevel hypergraph partitioning: application in VLSI domain
George Karypis,Rajat Aggarwal,Vipin Kumar,Shashi Shekhar +3 more
- 13 Jun 1997
TL;DR: The experiments show that the multilevel hypergraph partitioning algorithm produces high quality partitioning in relatively small amount of time and outperforms other schemes (in hyperedge cut) quite consistently with larger margins.
Multilevel hypergraph partitioning: applications in VLSI domain
TL;DR: A new hypergraph-partitioning algorithm that is based on the multilevel paradigm, which scales very well for large hypergraphs and produces high-quality partitioning in a relatively small amount of time.
1K
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning
Fatemeh Rahimian,Amir H. Payberah,Sarunas Girdzijauskas,Márk Jelasity,Seif Haridi +4 more
- 09 Sep 2013
TL;DR: A thorough experimental analysis shows that the minimal edge-cut value achieved by JA-BE-JA is comparable to state-of-the-art centralized algorithms such as METIS, which makes JA- BE-JA-a bottom-up, self-organizing algorithm-a highly competitive practical solution for graph partitioning.
Related Papers (5)
Foad Lotfifar,Matthew Johnson +1 more
- 24 Aug 2015
Jin Huang,Rui Zhang,Jeffrey Xu Yu +2 more
- 14 Nov 2015