research-article

Public Access

BiPart: a parallel and deterministic hypergraph partitioner

Authors:

Sepideh Maleki,

Martin Burtscher,

Keshav PingaliAuthors Info & Claims

PPoPP '21: Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Pages 161 - 174

https://doi.org/10.1145/3437801.3441611

Published: 17 February 2021 Publication History

Abstract

Hypergraph partitioning is used in many problem domains including VLSI design, linear algebra, Boolean satisfiability, and data mining. Most versions of this problem are NP-complete or NP-hard, so practical hypergraph partitioners generate approximate partitioning solutions for all but the smallest inputs. One way to speed up hypergraph partitioners is to exploit parallelism. However, existing parallel hypergraph partitioners are not deterministic, which is considered unacceptable in domains like VLSI design where the same partitions must be produced every time a given hypergraph is partitioned.

In this paper, we describe BiPart, the first deterministic, parallel hypergraph partitioner. Experimental results show that BiPart outperforms state-of-the-art hypergraph partitioners in runtime and partition quality while generating partitions deterministically.

References

[1]

Konstantin Andreev and Harald Räcke. 2004. Balanced Graph Partitioning. In Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (Barcelona, Spain) (SPAA '04). ACM, New York, NY, USA, 120--124.

Digital Library

[2]

Stephen Barnard and Horst Simon. 1993. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. 711--718.

[3]

C. Berge. 1973. Graphs and Hypergraphs. Amsterdam. https://books.google.com/books?id=X32GlVfqXjsC

[4]

Guy E Blelloch, Jeremy T Fineman, Phillip B Gibbons, and Julian Shun. 2012. Internally Deterministic Parallel Algorithms Can be Fast. In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming. 181--192.

Digital Library

[5]

T N Bui and C Jones. 1993. A Heuristic for Reducing Fill-in in Sparse Matrix Factorization. (12 1993).

[6]

Andrew E. Caldwell, Andrew B. Kahng, Andrew A. Kennings, and Igor L. Markov. 1999. Hypergraph Partitioning for VLSI CAD: Methodology for Heuristic Development, Experimentation and Reporting. In Proc. ACM/IEEE Design Automation Conf. (DAC 99), ACM. Press, 349--354.

[7]

Ümit Çatalyürek and Cevdet Aykanat. 2011. PaToH (Partitioning Tool for Hypergraphs). Springer US, Boston, MA, 1479--1487.

[8]

Timothy A Davis and Yifan Hu. 2011. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS) 38, 1 (2011), 1.

Digital Library

[9]

Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ceze, and Dan Grossman. 2011. RCDC: A Relaxed Consistency Deterministic Computer. ACM SIGARCH Computer Architecture News 39, 1 (2011), 67--78.

Digital Library

[10]

Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Rob H. Bisseling, and Umit V. Catalyurek. 2006. Parallel Hypergraph Partitioning for Scientific Computing. In Proceedings of the 20th International Conference on Parallel and Distributed Processing (Rhodes Island, Greece) (IPDPS'06). IEEE Computer Society, Washington, DC, USA, 124--124. http://dl.acm.org/citation.cfm?id=1898953.1899056

[11]

Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Rob H. Bisseling, and Umit V. Catalyurek. 2006. Parallel Hypergraph Partitioning for Scientific Computing. IEEE.

Digital Library

[12]

C. M. Fiduccia and R. M. Mattheyses. 1982. A Linear-Time Heuristic for Improving Network Partitions. In 19th Design Automation Conference. 175--181.

[13]

M. Fiedler. 1973. Algebraic Connectivity of Graphs. Czech. Math. J. 23 (1973), 298--305.

[14]

Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 855--864.

Digital Library

[15]

Bruce Hendrickson, Bruce Hendrickson, and Robert Leland. 1995. A Multilevel Algorithm for Partitioning Graphs. In Proceedings of the 1995 ACM/IEEE Conference on Supercomputing (San Diego, California, USA) (Supercomputing '95). ACM, New York, NY, USA, Article 28.

Digital Library

[16]

Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2019. Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. ACM J. Exp. Algorithmics 24, 1, Article 2.3 (Sept. 2019), 36 pages.

Digital Library

[17]

L. Hoang, R. Dathathri, G. Gill, and K. Pingali. 2019. CuSP: A Customizable Streaming Edge Partitioner for Distributed Graph Analytics. In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 439--450.

[18]

Derek R Hower, Polina Dudnik, Mark D Hill, and David A Wood. 2011. Calvin: Deterministic or Not? Free Will to Choose. In 2011 IEEE 17th International Symposium on High Performance Computer Architecture. IEEE, 333--334.

[19]

Joseph JáJá. 1992. An Introduction to Parallel Algorithms. Reading, MA: Addison-Wesley.

Digital Library

[20]

Igor Kabiljo, Brian Karrer, Mayank Pundir, Sergey Pupyrev, and Alon Shalita. 2017. Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. Proc. VLDB Endow. 10, 11 (Aug. 2017), 1418--1429.

Digital Library

[21]

Tim Kaler, William Hasenplaugh, Tao B Schardl, and Charles E Leiserson. 2016. Executing Dynamic Data-graph Computations Deterministically Using Chromatic Scheduling. ACM Transactions on Parallel Computing (TOPC) 3, 1 (2016), 1--31.

Digital Library

[22]

George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar. 1999. Multilevel Hypergraph Partitioning: Applications in VLSI Domain. IEEE Trans. Very Large Scale Integr. Syst. 7, 1 (March 1999), 69--79.

Digital Library

[23]

George Karypis and Vipin Kumar. 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20, 1 (Dec. 1998), 359--392.

Digital Library

[24]

B. W. Kernighan and S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49, 2 (Feb 1970), 291--307.

[25]

Boost library. [n.d.]. Boost C++ Libraries. https://www.boost.org/users/history/version_1_67_0.html

[26]

Sepideh Maleki and Martin Burtscher. 2018. Automatic Hierarchical Parallelization of Linear Recurrences. SIGPLAN Not. 53, 2 (March 2018), 128--138.

Digital Library

[27]

Christian Mayer, Ruben Mayer, Sukanya Bhowmik, Lukas Epple, and Kurt Rothermel. 2018. HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion. CoRR abs/1810.11319 (2018). arXiv:1810.11319

[28]

Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis. 1991. A Unified Geometric Approach to Graph Separators. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (SFCS '91). IEEE Computer Society, USA, 538--547.

Digital Library

[29]

T.M. Mitchell. 1997. Machine Learning. McGraw-Hill. https://books.google.com/books?id=EoYBngEACAAJ

Digital Library

[30]

W. Lau Neto, M. Austin, S. Temple, L. Amaru, X. Tang, and P.-E. Gaillardon. 2019. LSOracle: A Logic Synthesis Framework Driven by Artificial Intelligence. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[31]

Donald Nguyen, Andrew Lenharth, and Keshav Pingali. 2013. A Lightweight Infrastructure for Graph Analytics. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (Farminton, Pennsylvania) (SOSP '13). ACM, New York, NY, USA, 456--471.

Digital Library

[32]

Donald Nguyen, Andrew Lenharth, and Keshav Pingali. 2014. Deterministic Galois: On-demand, Portable and Parameterless. In Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '14).

Digital Library

[33]

Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online Learning of Social Representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 701--710.

Digital Library

[34]

Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, and Xin Sui. 2011. The Tao of Parallelism in Algorithms. In PLDI 2011. 12--25.

[35]

Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, and Xin Sui. 2011. The TAO of parallelism in algorithms. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (San Jose, California, USA) (PLDI '11). 12--25.

Digital Library

[36]

A. Pothen, H. Simon, and K.-P. Liou. 1990. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. Matrix Anal. Appl. 11 (1990), 430--452.

Digital Library

[37]

G. Qu, Z. Fang, J. Zhang, and S. Zheng. 2015. Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs. IEEE Transactions on Parallel and Distributed Systems 26, 4 (April 2015), 1154--1164.

Digital Library

[38]

Aleksandar Trifunović and William J. Knottenbelt. 2008. Parallel Multilevel Algorithms for Hypergraph Partitioning. J. Parallel Distrib. Comput. 68, 5 (May 2008), 563--581.

Digital Library

[39]

F. Xia, A. M. Ahmed, L. T. Yang, and Z. Luo. 2015. Community-Based Event Dissemination with Optimal Load Balancing. IEEE Trans. Comput. 64, 7 (July 2015), 1857--1869.

Digital Library

[40]

Wenyin Yang, Guojun Wang, Li Ma, and Shiyang Wu. 2016. A Distributed Algorithm for Balanced Hypergraph Partitioning. In Advances in Services Computing, Guojun Wang, Yanbo Han, and Gregorio Martínez Pérez (Eds.). Springer International Publishing, Cham, 477--490.

Cited By

Gottesbüren LHeuer TMaas NSanders PSchlag S(2024)Scalable High-Quality Hypergraph PartitioningACM Transactions on Algorithms10.1145/362652720:1(1-54)Online publication date: 22-Jan-2024
https://dl.acm.org/doi/10.1145/3626527
Liu YLuo QXiao MYu DChen HCheng X(2024)Reordering and Compression for Hypergraph ProcessingIEEE Transactions on Computers10.1109/TC.2024.337791573:6(1486-1499)Online publication date: Jun-2024
https://doi.org/10.1109/TC.2024.3377915
Siddiqi UGrewal GAreibi S(2024)A Recursive Partitioning Approach to Improving Hypergraph Partitioning2024 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)10.1109/CCECE59415.2024.10667338(240-245)Online publication date: 6-Aug-2024
https://doi.org/10.1109/CCECE59415.2024.10667338
Show More Cited By

Index Terms

BiPart: a parallel and deterministic hypergraph partitioner
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
      1. Shared memory algorithms

Recommendations

Multilevel hypergraph partitioning: applications in VLSI domain

In this paper, we present a new hypergraph-partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and ...
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, ...
HEPart

Minimizing the query cost among multi-hosts is important to data processing for big data applications. Hypergraph is good at modelingdata and data relationships of complex networks, the typical big data applications, by representing multi-way ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPoPP '21: Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 2021

507 pages

ISBN:9781450382946

DOI:10.1145/3437801

General Chair:
Jaejin Lee
Seoul National University, South Korea
,
Program Chair:
Erez Petrank
Technion, Israel

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 February 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Author Tags

Qualifiers

Research-article

Funding Sources

DARPA

Conference

PPoPP '21

Sponsor:

PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 27, 2021

Virtual Event, Republic of Korea

Acceptance Rates

PPoPP '21 Paper Acceptance Rate 31 of 150 submissions, 21%;

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
843
Total Downloads

Downloads (Last 12 months)225
Downloads (Last 6 weeks)24

Reflects downloads up to 11 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gottesbüren LHeuer TMaas NSanders PSchlag S(2024)Scalable High-Quality Hypergraph PartitioningACM Transactions on Algorithms10.1145/362652720:1(1-54)Online publication date: 22-Jan-2024
https://dl.acm.org/doi/10.1145/3626527
Liu YLuo QXiao MYu DChen HCheng X(2024)Reordering and Compression for Hypergraph ProcessingIEEE Transactions on Computers10.1109/TC.2024.337791573:6(1486-1499)Online publication date: Jun-2024
https://doi.org/10.1109/TC.2024.3377915
Siddiqi UGrewal GAreibi S(2024)A Recursive Partitioning Approach to Improving Hypergraph Partitioning2024 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)10.1109/CCECE59415.2024.10667338(240-245)Online publication date: 6-Aug-2024
https://doi.org/10.1109/CCECE59415.2024.10667338
Çatalyürek ÜDevine KFaraj MGottesbüren LHeuer TMeyerhenke HSanders PSchlag SSchulz CSeemaier DWagner D(2023)More Recent Advances in (Hyper)Graph PartitioningACM Computing Surveys10.1145/357180855:12(1-38)Online publication date: 2-Mar-2023
https://dl.acm.org/doi/10.1145/3571808
Bustany IGasparyan GKahng AKoutis IPramanik BWang Z(2023)An Open-Source Constraints-Driven General Partitioning Multi-Tool for VLSI Physical Design2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323975(1-9)Online publication date: 28-Oct-2023
https://doi.org/10.1109/ICCAD57390.2023.10323975
Dai QGao YDai QGao Y(2023)Large Scale Hypergraph ComputationHypergraph Computation10.1007/978-981-99-0185-2_8(145-157)Online publication date: 17-Jan-2023
https://doi.org/10.1007/978-981-99-0185-2_8
Wang QZheng LYuan JHuang YYao PGui CHu ALiao XJin H(2022)Hardware-Accelerated Hypergraph Processing with Chain-Driven Scheduling2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA53966.2022.00022(184-198)Online publication date: Apr-2022
https://doi.org/10.1109/HPCA53966.2022.00022
Gottesbüren LHamann M(2022)Deterministic Parallel Hypergraph PartitioningEuro-Par 2022: Parallel Processing10.1007/978-3-031-12597-3_19(301-316)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-12597-3_19
Maleki SSaless DWall DPingali K(2022)HyperNetVec: Fast and Scalable Hierarchical Embedding for HypergraphsNetwork Science10.1007/978-3-030-97240-0_13(169-183)Online publication date: 8-Feb-2022
https://dl.acm.org/doi/10.1007/978-3-030-97240-0_13
Fujimura SSato STaura K(2021)An Efficient and Scalable Distributed Hypergraph Processing SystemJournal of Information Processing10.2197/ipsjjip.29.81229(812-822)Online publication date: 2021
https://doi.org/10.2197/ipsjjip.29.812

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents