Parallel multilevel algorithms for hypergraph partitioning
TL;DR: This paper presents parallel multilevel algorithms for the hypergraph partitioning problem, in particular, for parallel coarsening, parallel greedy k-way refinement and parallel multi-phase refinement and derives the isoefficiency function for these algorithms using an asymptotic theoretical performance model.
read more
About: This article is published in Journal of Parallel and Distributed Computing. The article was published on 01 May 2008. and is currently open access. The article focuses on the topics: Analysis of parallel algorithms & Parallel algorithm.
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
Recent Advances in Graph Partitioning
Aydin Buluc,Henning Meyerhenke,Ilya Safro,Peter Sanders,Christian Schulz +4 more
- 01 Nov 2016
TL;DR: In this article, the authors survey recent trends in practical algorithms for balanced graph partitioning, point to applications, and discuss future research directions, and present a survey of the most popular algorithms.
Scalable work stealing
James Dinan,D. Brian Larkins,P. Sadayappan,Sriram Krishnamoorthy,Jarek Nieplocha +4 more
- 14 Nov 2009
TL;DR: This work investigates the design and scalability of work stealing on modern distributed memory systems and demonstrates high efficiency and low overhead when scaling to 8,192 processors for three benchmark codes: a producer-consumer benchmark, the unbalanced tree search benchmark, and a multiresolution analysis kernel.
312
A new diffusion-based multilevel algorithm for computing graph partitions
TL;DR: Besides proving that BUBBLE-FOS/C converges towards a local optimum, this paper develops a much faster method for the improvement of partitionings, based on a different diffusive process, which is restricted to local areas of the graph and also contains a high degree of parallelism.
111
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.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
George Karypis,Vipin Kumar +1 more
TL;DR: This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.
An efficient heuristic procedure for partitioning graphs
Brian W. Kernighan,Shou-De Lin +1 more
TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
5.5K
•Book
MPI: The Complete Reference
Marc Snir,Steve W. Otto,David W. Walker,Jack Dongarra,Steven Huss-Lederman +4 more
- 01 Jan 1996
TL;DR: MPI: The Complete Reference is an annotated manual for the latest 1.1 version of the standard that illuminates the more advanced and subtle features of MPI and covers such advanced issues in parallel computing and programming as true portability, deadlock, high-performance message passing, and libraries for distributed and parallel computing.
2.8K