High-Quality Shared-Memory Graph Partitioning

Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partit...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 31; no. 11; pp. 2710 - 2722
Main Authors:	Akhremtsev, Yaroslav, Sanders, Peter, Schulz, Christian
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Balance criterion Clustering algorithms Complex networks Contracts Graphs label propagation local search Parallel algorithms Parallel graph partitioning Partitioning Partitioning algorithms Program processors shared-memory parallelism
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitioning have problems in this context since they often show a negative trade-off between speed and quality. We present an approach to multi-level shared-memory parallel graph partitioning that produces balanced solutions, shows high speedups for a variety of large graphs and yields very good quality independently of the number of cores used. For example, in an extensive experimental study, at 79 cores, one of our closest competitors is faster but fails to meet the balance criterion in the majority of cases and another is mostly slower and incurs about 13 percent larger cut size. Important ingredients include parallel label propagation for both coarsening and refinement, parallel initial partitioning, a simple yet effective approach to parallel localized local search, and fast locality preserving hash tables.
AbstractList	Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitioning have problems in this context since they often show a negative trade-off between speed and quality. We present an approach to multi-level shared-memory parallel graph partitioning that produces balanced solutions, shows high speedups for a variety of large graphs and yields very good quality independently of the number of cores used. For example, in an extensive experimental study, at 79 cores, one of our closest competitors is faster but fails to meet the balance criterion in the majority of cases and another is mostly slower and incurs about 13 percent larger cut size. Important ingredients include parallel label propagation for both coarsening and refinement, parallel initial partitioning, a simple yet effective approach to parallel localized local search, and fast locality preserving hash tables.
Author	Sanders, Peter Schulz, Christian Akhremtsev, Yaroslav
Author_xml	– sequence: 1 givenname: Yaroslav surname: Akhremtsev fullname: Akhremtsev, Yaroslav email: classboxmail@gmail.com organization: Google, Zurich, Switzerland – sequence: 2 givenname: Peter surname: Sanders fullname: Sanders, Peter email: sanders@kit.edu organization: Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany – sequence: 3 givenname: Christian orcidid: 0000-0002-2823-3506 surname: Schulz fullname: Schulz, Christian email: christian.schulz@univie.ac.at organization: Faculty of Computer Science, University of Vienna, Vienna, Austria
BookMark	eNp9kE1PAjEQQBuDiYD-AOOFxHOx0w-2PRoUMMGIAc9NtzsLJbCL3eXAv3c3EA8ePHUO7800r0c6RVkgIffAhgDMPK0WL8shZ5wNBWMwkuqKdEEpTTlo0WlmJhU1HMwN6VXVtmGkYrJL6CysN_Tz6HahPg2WGxcxo--4L-NpMI3usBksXKxDHcoiFOtbcp27XYV3l7dPviavq_GMzj-mb-PnOfVCmZoKrVLm89TkKQNIdMYSD2niM4moRwbBSJMZLcUIU-Uzx7xBhZjlikvNMBN98njee4jl9xGr2m7LYyyak5ZLSKRINGcNlZwpH8uqiphbH2rXfrWOLuwsMNu2sW0b27axlzaNCX_MQwx7F0__Og9nJyDiL28AFOda_ABToXB9
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_1109_TON_2025_3548904 crossref_primary_10_1016_j_eswa_2024_125756 crossref_primary_10_1145_3451214 crossref_primary_10_1016_j_jpdc_2021_07_008 crossref_primary_10_1080_17445760_2023_2174540 crossref_primary_10_1109_ACCESS_2022_3219422 crossref_primary_10_1088_1742_6596_2832_1_012005 crossref_primary_10_14778_3746405_3746423 crossref_primary_10_1145_3529090 crossref_primary_10_1145_3734522 crossref_primary_10_1137_23M1559129 crossref_primary_10_1109_TPDS_2024_3501292 crossref_primary_10_1145_3571808 crossref_primary_10_1155_2021_6639008 crossref_primary_10_1016_j_ins_2024_120473 crossref_primary_10_1109_TPDS_2021_3139111 crossref_primary_10_1016_j_future_2023_12_008
Cites_doi	10.1145/2433396.2433461 10.1109/DAC.1982.1585498 10.1109/ICPP.2016.34 10.1109/71.780863 10.1109/TPDS.2017.2671868 10.1007/978-3-642-15775-2_24 10.1103/PhysRevE.76.036106 10.1145/3309206 10.1145/1993636.1993638 10.1007/978-3-319-07959-2_30 10.1109/IPDPS.2013.50 10.1109/IPDPS.2017.95 10.1109/ICDE.2014.6816682 10.1007/978-3-319-77525-8_312 10.2307/3001968 10.1007/978-1-4614-6170-8_23 10.1145/988672.988752 10.1016/0020-0190(92)90140-Q 10.1016/j.parco.2007.12.001 10.1145/2487575.2487696 10.4203/csets.17.2 10.1007/s10732-016-9315-8 10.1109/ICDE.2017.153 10.1007/978-3-540-74466-5_72 10.1007/978-3-642-23719-5_40 10.1145/2486159.2486189 10.1145/2556195.2556213 10.1109/TPDS.2015.2390633 10.1090/conm/588/11699 10.1145/2049662.2049663 10.1137/15M1026183 10.1016/0743-7315(91)90074-J 10.1109/IPDPS.2010.5470485 10.1007/978-3-662-48971-0_40 10.1007/978-3-030-25209-0 10.1103/PhysRevE.82.036106 10.14778/3236187.3236208 10.1145/2339530.2339722 10.1137/S1064827595287997 10.1145/369028.369103 10.1007/978-3-319-49487-6_4 10.1145/227234.227246 10.1145/2851496 10.1109/IPDPS.2018.00043
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TPDS.2020.3001645
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore Digital Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	2722
ExternalDocumentID	10_1109_TPDS_2020_3001645 9115228
Genre	orig-research
GrantInformation_xml	– fundername: DFG grantid: SA 933/10-2; SCHU 2567/1-2
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS TN5 TWZ UHB AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c359t-385b0cfb9fb01178d07c1b7cd4ee869e1949d98436eb5cda0c9e5eedf52480ed3
IEDL.DBID	RIE
ISICitedReferencesCount	24
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000543712400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1045-9219
IngestDate	Sun Nov 09 05:51:44 EST 2025 Sat Nov 29 06:06:47 EST 2025 Tue Nov 18 22:11:21 EST 2025 Wed Aug 27 02:38:25 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	11
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c359t-385b0cfb9fb01178d07c1b7cd4ee869e1949d98436eb5cda0c9e5eedf52480ed3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-2823-3506
PQID	2417437820
PQPubID	85437
PageCount	13
ParticipantIDs	proquest_journals_2417437820 crossref_citationtrail_10_1109_TPDS_2020_3001645 crossref_primary_10_1109_TPDS_2020_3001645 ieee_primary_9115228
PublicationCentury	2000
PublicationDate	2020-11-01
PublicationDateYYYYMMDD	2020-11-01
PublicationDate_xml	– month: 11 year: 2020 text: 2020-11-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2020
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 ref53 ref52 ref11 shun (ref40) 2013 ref54 ref10 laboratory of web algorithms (ref45) 0 ref17 ref16 ref19 ref18 ref51 ref50 kernighan (ref30) 1969 ref46 ref47 ref42 ref41 ref49 ref8 ref7 ref9 ref4 axtmann (ref36) 2017 ref3 ref6 ref35 (ref43) 0 ref31 leskovec (ref44) 2014 ref33 ref32 (ref37) 0 ref2 ref1 ref39 ref38 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 schloegel (ref5) 2003 ref27 ref29 akhremtsev (ref34) 2019 bader (ref48) 2013
References_xml	– ident: ref18 doi: 10.1145/2433396.2433461 – ident: ref31 doi: 10.1109/DAC.1982.1585498 – ident: ref12 doi: 10.1109/ICPP.2016.34 – ident: ref17 doi: 10.1109/71.780863 – ident: ref19 doi: 10.1109/TPDS.2017.2671868 – ident: ref33 doi: 10.1007/978-3-642-15775-2_24 – year: 2013 ident: ref48 publication-title: 10th DIMACS Implementation Challenge-Graph Partitioning and Graph Clustering 2011 – year: 0 ident: ref37 article-title: Intel threading building blocks – ident: ref16 doi: 10.1103/PhysRevE.76.036106 – ident: ref39 doi: 10.1145/3309206 – year: 1969 ident: ref30 article-title: Some graph partitioning problems related to program segmentation – ident: ref41 doi: 10.1145/1993636.1993638 – ident: ref3 doi: 10.1007/978-3-319-07959-2_30 – ident: ref13 doi: 10.1109/IPDPS.2013.50 – ident: ref22 doi: 10.1109/IPDPS.2017.95 – ident: ref20 doi: 10.1109/ICDE.2014.6816682 – ident: ref8 doi: 10.1007/978-3-319-77525-8_312 – start-page: 491 year: 2003 ident: ref5 article-title: Graph partitioning for high performance scientific simulations publication-title: The Sourcebook of Parallel Computing – ident: ref52 doi: 10.2307/3001968 – ident: ref47 doi: 10.1007/978-1-4614-6170-8_23 – ident: ref53 doi: 10.1145/988672.988752 – ident: ref1 doi: 10.1016/0020-0190(92)90140-Q – ident: ref10 doi: 10.1016/j.parco.2007.12.001 – ident: ref27 doi: 10.1145/2487575.2487696 – year: 2014 ident: ref44 article-title: SNAP Datasets: Stanford large network dataset collection – ident: ref6 doi: 10.4203/csets.17.2 – year: 2019 ident: ref34 article-title: Parallel and external high quality graph partitioning – ident: ref29 doi: 10.1007/s10732-016-9315-8 – ident: ref26 doi: 10.1109/ICDE.2017.153 – ident: ref38 doi: 10.1007/978-3-540-74466-5_72 – ident: ref2 doi: 10.1007/978-3-642-23719-5_40 – year: 0 ident: ref45 article-title: Datasets – start-page: 152 year: 2013 ident: ref40 article-title: Reducing contention through priority updates publication-title: Proc ACM Symp Parallelism Algorithms Architect doi: 10.1145/2486159.2486189 – ident: ref24 doi: 10.1145/2556195.2556213 – ident: ref35 doi: 10.1109/TPDS.2015.2390633 – ident: ref15 doi: 10.1090/conm/588/11699 – ident: ref51 doi: 10.1145/2049662.2049663 – year: 0 ident: ref43 – ident: ref21 doi: 10.1137/15M1026183 – ident: ref32 doi: 10.1016/0743-7315(91)90074-J – ident: ref50 doi: 10.1109/IPDPS.2010.5470485 – ident: ref49 doi: 10.1007/978-3-662-48971-0_40 – ident: ref42 doi: 10.1007/978-3-030-25209-0 – ident: ref54 doi: 10.1103/PhysRevE.82.036106 – ident: ref25 doi: 10.14778/3236187.3236208 – start-page: 9:1 year: 2017 ident: ref36 article-title: In-place parallel super scalar samplesort (IPSSSSo) publication-title: Proc 25th Annu Eur Symp Algorithms – ident: ref23 doi: 10.1145/2339530.2339722 – ident: ref9 doi: 10.1137/S1064827595287997 – ident: ref11 doi: 10.1145/369028.369103 – ident: ref7 doi: 10.1007/978-3-319-49487-6_4 – ident: ref14 doi: 10.1109/IPDPS.2010.5470485 – ident: ref4 doi: 10.1145/227234.227246 – ident: ref28 doi: 10.1145/2851496 – ident: ref46 doi: 10.1109/IPDPS.2018.00043
SSID	ssj0014504
Score	2.4911232
Snippet	Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently,...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	2710
SubjectTerms	Balance criterion Clustering algorithms Complex networks Contracts Graphs label propagation local search Parallel algorithms Parallel graph partitioning Partitioning Partitioning algorithms Program processors shared-memory parallelism
Title	High-Quality Shared-Memory Graph Partitioning
URI	https://ieeexplore.ieee.org/document/9115228 https://www.proquest.com/docview/2417437820
Volume	31
WOSCitedRecordID	wos000543712400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore Digital Library customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3BSgMxEB2seNCD1apYrbIHT2I03U12k6Oo1YOWggrelk0yAUFaaavg35tk00VRBG85JMvyJpOZSWbeABwhy925KHKiBLeE2bRPBGeMiLTKqHJRs6mCpG-L4VA8PcnREpw0tTCIGJLP8NQPw1u-meg3f1V25hTTuQuiBa2iyOtarebFgPHQKtBFF5xIp4bxBbNP5dnD6PLeRYKpC1ADoxT_ZoNCU5UfJ3EwL4P2_35sA9ajG5mc13LfhCUcd6C9aNGQRI3twNoXvsEtID6rg9S0GR-J52pGQ-58ru1Hcu2Zq5OR30nxjnYbHgdXDxc3JPZLIDrjck4ywRXVVkmrPNObMLTQfVVowxBFLtEhL40ULMtRcW0qqiVyZyMtT5mgaLIdWB5PxrgLiYsqc2mt6lfo6XuMG1epopjlVqQ6tV2gCwRLHcnEfU-LlzIEFVSWHvTSg15G0Ltw3Cx5rZk0_pq85VFuJkaAu9BbiKmMujYrnQ_i3CDP-7f3-6p9WPXfrisIe7A8n77hAazo9_nzbHoYttEn0VLDLw
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFdSDj6pYn3vwJMZmH9kmR1GrYlsKVvC2bJIJCFJFW8F_b5JNi6II3nJIsss3mcxMJvkG4Aiz3O6LPCeSM0Myk8SEsywjPClTKm3UrEsv6W673-cPD2JQg5PZWxhE9JfP8NQ1fS5fP6uJOyprWcW07gKfg3k7XUKr11qznEHGfLFAG18wIqwihhxmTEVrOLi4s7FgYkNUzynFvlkhX1blx17sDUxn9X-_tgYrwZGMzirJr0MNRw1YnRZpiILONmD5C-PgBhB3r4NUxBkfkWNrRk167rbtR3TluKujgVtL4ZR2E-47l8PzaxIqJhCVMjEmKWeSKiOFkY7rjWvaVrFsK50h8lygxV5owbM0R8mULqkSyKyVNCzJOEWdbkF99DzCbYhsXJkLY2RcoiPw0bZdJpJimhueqMQ0gU4RLFSgE3dVLZ4KH1ZQUTjQCwd6EUBvwvFsyEvFpfFX5w2H8qxjALgJe1MxFUHb3grrhVhHyDH_7fw-6hAWr4e9btG96d_uwpL7TvWecA_q49cJ7sOCeh8_vr0e-CX1CSUAxnY
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=High-Quality+Shared-Memory+Graph+Partitioning&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Akhremtsev%2C+Yaroslav&rft.au=Sanders%2C+Peter&rft.au=Schulz%2C+Christian&rft.date=2020-11-01&rft.pub=IEEE&rft.issn=1045-9219&rft.volume=31&rft.issue=11&rft.spage=2710&rft.epage=2722&rft_id=info:doi/10.1109%2FTPDS.2020.3001645&rft.externalDocID=9115228
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon