A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of multilevel algorithms) is that it partitions the vertices of the gr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of parallel and distributed computing Ročník 48; číslo 1; s. 71 - 95
Hlavní autoři:	Karypis, George, Kumar, Vipin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 10.01.1998 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology fill reducing ordering Information retrieval. Graph multilevel partitioning methods numerical linear algebra parallel graph partitioning Software Theoretical computing numerical linear algebra parallel graph partitioning fill reducing ordering multilevel partitioning methods Partition Parallel algorithm Distributed memory multiprocessor system Numerical computation Algorithm performance Linear algebra Sparse matrix Graph theory Distributed system Experimental study
ISSN:	0743-7315, 1096-0848
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of multilevel algorithms) is that it partitions the vertices of the graph intopparts while distributing the overall adjacency matrix of the graph among allpprocessors. This mapping results in substantially smaller communication than one-dimensional distribution for graphs with relatively high degree, especially if the graph is randomly distributed among the processors. We also present a parallel algorithm for computing a minimal cover of a bipartite graph which is a key operation for obtaining a small vertex separator that is useful for computing the fill reducing ordering of sparse matrices. Our parallel algorithm achieves a speedup of up to 56 on 128 processors for moderate size problems, further reducing the already moderate serial run time of multilevel schemes. Furthermore, the quality of the produced partitions and orderings are comparable to those produced by the serial multilevel algorithm that has been shown to outperform both spectral partitioning and multiple minimum degree.
AbstractList	In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of multilevel algorithms) is that it partitions the vertices of the graph intopparts while distributing the overall adjacency matrix of the graph among allpprocessors. This mapping results in substantially smaller communication than one-dimensional distribution for graphs with relatively high degree, especially if the graph is randomly distributed among the processors. We also present a parallel algorithm for computing a minimal cover of a bipartite graph which is a key operation for obtaining a small vertex separator that is useful for computing the fill reducing ordering of sparse matrices. Our parallel algorithm achieves a speedup of up to 56 on 128 processors for moderate size problems, further reducing the already moderate serial run time of multilevel schemes. Furthermore, the quality of the produced partitions and orderings are comparable to those produced by the serial multilevel algorithm that has been shown to outperform both spectral partitioning and multiple minimum degree.
Author	Kumar, Vipin Karypis, George
Author_xml	– sequence: 1 givenname: George surname: Karypis fullname: Karypis, George – sequence: 2 givenname: Vipin surname: Kumar fullname: Kumar, Vipin
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2211418$$DView record in Pascal Francis
BookMark	eNp1kD1PwzAQhi1UJNrCypyBNcGXOB8dqwoKUquCgNly7HPryk0i21Tw70lUxIDU6Yb3fU53z4SMmrZBQm6BJkBpcb_vlExgNisTYDS7IGOgsyKmFatGZExLlsVlBvkVmXi_pxQgL6sxeZ1HL8IJa9FGc7ttnQm7Q6RbF60_bTAWj32wdKLbDb1ggmkb02wj0ajorRPOY7QWwZmvaOMUuj66JpdaWI83v3NKPh4f3hdP8WqzfF7MV7HsrwgxVmnKlCzyVIIqc63TshA1Y3VRoFI15IqiLBAhp7nQitIsrSuYYcUgLZWm2ZTcnfZ2wkthtRONNJ53zhyE--ZpCsCg6mvJqSZd671D_dcAygdvfPDGB2988NYD7B8gTRDD38EJY89j1QnD_uejQce9NNhIVMahDFy15hz6A542h94
CitedBy_id	crossref_primary_10_1080_00268976_2011_631055 crossref_primary_10_1108_09615531011008118 crossref_primary_10_1109_MIC_2018_053681359 crossref_primary_10_1016_j_ins_2022_05_096 crossref_primary_10_1109_TPDS_2021_3090316 crossref_primary_10_1007_s11831_017_9227_2 crossref_primary_10_1016_j_matcom_2023_04_002 crossref_primary_10_1016_S0098_1354_99_00314_2 crossref_primary_10_1177_1094342011429952 crossref_primary_10_1080_09544828_2013_776214 crossref_primary_10_1016_j_finel_2013_08_003 crossref_primary_10_1137_21M1430698 crossref_primary_10_1137_16M1103518 crossref_primary_10_1016_S0743_7315_03_00112_6 crossref_primary_10_1111_j_1365_246X_2011_05044_x crossref_primary_10_1088_2634_4386_ad3be7 crossref_primary_10_1080_17445760_2018_1506453 crossref_primary_10_1137_S0036144598334138 crossref_primary_10_1109_TMAG_2017_2759145 crossref_primary_10_1002_nme_2972 crossref_primary_10_1002_cpe_1591 crossref_primary_10_1016_j_future_2019_06_033 crossref_primary_10_1007_s00158_021_02887_2 crossref_primary_10_1190_geo2014_0067_1 crossref_primary_10_1137_20M1332748 crossref_primary_10_1007_s12665_011_1270_y crossref_primary_10_1016_j_cplett_2017_01_056 crossref_primary_10_1186_s40537_019_0257_5 crossref_primary_10_1109_TPDS_2020_3002150 crossref_primary_10_1016_j_jpdc_2018_02_008 crossref_primary_10_1109_JLT_2005_853124 crossref_primary_10_1109_TPDS_2021_3069292 crossref_primary_10_3390_en18123017 crossref_primary_10_1016_j_jpdc_2016_02_003 crossref_primary_10_1007_s10470_020_01648_3 crossref_primary_10_1007_s11075_022_01429_1 crossref_primary_10_1007_s00366_009_0129_2 crossref_primary_10_1109_ACCESS_2021_3075457 crossref_primary_10_1016_j_jcp_2020_110084 crossref_primary_10_1137_12088313X crossref_primary_10_1002_fld_4204 crossref_primary_10_1145_3466685 crossref_primary_10_1016_j_envsoft_2021_105045 crossref_primary_10_1016_j_parco_2011_05_007 crossref_primary_10_1007_s10596_017_9696_2 crossref_primary_10_1145_2786977 crossref_primary_10_1002_nla_2051 crossref_primary_10_1145_1932682_1869527 crossref_primary_10_1002_jcc_24254 crossref_primary_10_1016_j_cam_2016_08_033 crossref_primary_10_1016_j_compfluid_2013_06_008 crossref_primary_10_1016_S0965_9978_02_00141_2 crossref_primary_10_1016_j_future_2018_01_009 crossref_primary_10_1016_j_jpdc_2004_03_017 crossref_primary_10_1016_j_swevo_2016_01_003 crossref_primary_10_1109_TCNS_2014_2357532 crossref_primary_10_1007_s10845_006_0039_8 crossref_primary_10_1017_S0962492916000076 crossref_primary_10_1063_5_0169546 crossref_primary_10_1016_S0045_7825_00_00389_3 crossref_primary_10_1016_j_epsr_2023_109788 crossref_primary_10_1190_geo2018_0153_1 crossref_primary_10_1137_120876083 crossref_primary_10_1016_j_compfluid_2012_09_030 crossref_primary_10_1137_20M1383033 crossref_primary_10_1002_nme_3324 crossref_primary_10_1016_j_cosrev_2018_01_003 crossref_primary_10_1016_S0965_9978_00_00068_5 crossref_primary_10_1016_j_epsr_2016_06_024 crossref_primary_10_1016_j_jcp_2013_09_009 crossref_primary_10_1109_TCSS_2022_3226230 crossref_primary_10_1016_j_finel_2020_103484 crossref_primary_10_1109_TC_2002_1146709 crossref_primary_10_1007_s10618_021_00754_8 crossref_primary_10_1177_1094342015607609 crossref_primary_10_1137_16M110486X crossref_primary_10_1016_j_parco_2022_102897 crossref_primary_10_1137_S1064827595287997 crossref_primary_10_1145_3155292 crossref_primary_10_1145_3661998 crossref_primary_10_3390_s20143819 crossref_primary_10_1007_s11831_014_9098_8 crossref_primary_10_1016_j_oceaneng_2022_112395 crossref_primary_10_1088_0266_5611_31_8_085005 crossref_primary_10_1016_j_cpc_2019_03_007 crossref_primary_10_1111_j_1365_246X_2011_05167_x crossref_primary_10_1016_j_jpdc_2019_03_016 crossref_primary_10_1109_TKDE_2020_3022014 crossref_primary_10_1007_s13042_019_00989_4 crossref_primary_10_1016_j_ijggc_2014_12_012 crossref_primary_10_1080_10556788_2016_1193177 crossref_primary_10_1260_1756_8250_3_1_1 crossref_primary_10_1007_s10462_011_9203_4 crossref_primary_10_1016_j_parco_2016_02_003 crossref_primary_10_1155_2017_2580820 crossref_primary_10_1137_18M1193992 crossref_primary_10_1137_15M1014097 crossref_primary_10_1137_09077432X crossref_primary_10_1152_japplphysiol_00178_2018 crossref_primary_10_1007_s10494_017_9876_0 crossref_primary_10_1002_nme_6611 crossref_primary_10_1016_j_cma_2025_117830 crossref_primary_10_1145_2331130_2331132 crossref_primary_10_1016_j_knosys_2018_03_021 crossref_primary_10_1002_nla_2017 crossref_primary_10_1016_j_compfluid_2012_06_025 crossref_primary_10_1016_S0045_7825_00_00202_4 crossref_primary_10_1016_S1463_5003_02_00063_X crossref_primary_10_2514_1_J064791 crossref_primary_10_1016_j_parco_2017_07_001 crossref_primary_10_1016_j_camwa_2019_09_012 crossref_primary_10_1016_j_compstruc_2024_107339 crossref_primary_10_1023_B_HEUR_0000026898_11874_e7 crossref_primary_10_1137_15M1040049 crossref_primary_10_1016_j_cma_2020_113169 crossref_primary_10_1145_2007183_2007185 crossref_primary_10_1002_fld_2264 crossref_primary_10_1007_s10586_006_4893_0 crossref_primary_10_1016_j_laa_2014_02_007 crossref_primary_10_1016_j_cma_2022_114656 crossref_primary_10_1016_j_cad_2014_08_013 crossref_primary_10_1137_18M1166407 crossref_primary_10_1134_S1995423918020039 crossref_primary_10_1016_j_compfluid_2018_01_040 crossref_primary_10_1016_j_cpc_2012_09_008 crossref_primary_10_1137_050638102 crossref_primary_10_1016_j_procs_2022_07_118 crossref_primary_10_1016_S0965_9978_00_00036_3 crossref_primary_10_1137_100791634 crossref_primary_10_1007_s00366_006_0049_3 crossref_primary_10_1016_j_jocs_2011_01_002 crossref_primary_10_1016_j_jpdc_2003_11_010 crossref_primary_10_1002_eqe_896 crossref_primary_10_1016_S0167_8191_03_00099_1 crossref_primary_10_1002_nla_343 crossref_primary_10_2136_vzj2010_0099 crossref_primary_10_2514_1_J060434 crossref_primary_10_1155_2013_751030 crossref_primary_10_1080_03081087_2015_1133557 crossref_primary_10_1145_3571808 crossref_primary_10_1109_TMAG_2007_892274 crossref_primary_10_1007_s00224_014_9557_5 crossref_primary_10_1109_TPDS_2024_3387720 crossref_primary_10_1016_j_jcp_2016_06_017 crossref_primary_10_1007_s00343_010_9937_x crossref_primary_10_1016_j_amc_2006_05_090 crossref_primary_10_1016_j_jpdc_2019_07_011 crossref_primary_10_1016_j_pnucene_2011_10_013 crossref_primary_10_1016_j_jcp_2023_112397 crossref_primary_10_1016_j_jpdc_2007_11_002 crossref_primary_10_1016_S0167_8191_01_00141_7 crossref_primary_10_1007_s40571_014_0009_4 crossref_primary_10_1007_s10619_017_7196_y crossref_primary_10_1007_s10115_011_0397_1 crossref_primary_10_1016_j_ocemod_2006_03_006 crossref_primary_10_1016_S0307_904X_00_00045_7 crossref_primary_10_1007_s10596_010_9179_1 crossref_primary_10_1016_j_fmre_2021_09_019 crossref_primary_10_1016_j_jpdc_2016_12_005 crossref_primary_10_1016_j_jcp_2017_06_020 crossref_primary_10_1109_ACCESS_2022_3219422 crossref_primary_10_1109_TMAG_2006_889766 crossref_primary_10_1016_j_cma_2019_03_052 crossref_primary_10_1016_j_jcp_2003_07_005 crossref_primary_10_1088_0953_8984_26_30_305503 crossref_primary_10_1002_nme_769 crossref_primary_10_1002_nag_190 crossref_primary_10_1016_j_jcp_2011_02_005 crossref_primary_10_1109_TAP_2020_3037651 crossref_primary_10_1016_j_knosys_2006_11_013 crossref_primary_10_1016_j_cja_2018_06_018 crossref_primary_10_1016_S0167_8191_03_00101_7 crossref_primary_10_2514_1_J053361 crossref_primary_10_1016_j_apm_2006_06_007
Cites_doi	10.1109/71.598277 10.1137/0215074 10.1016/0743-7315(91)90074-J 10.1137/1033099 10.1006/jpdc.1997.1404 10.1145/214392.214398 10.1002/j.1538-7305.1970.tb01770.x 10.1145/98267.98287 10.1145/224170.224227
ContentType	Journal Article
Copyright	1998 Academic Press 1998 INIST-CNRS
Copyright_xml	– notice: 1998 Academic Press – notice: 1998 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1006/jpdc.1997.1403
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1096-0848
EndPage	95
ExternalDocumentID	2211418 10_1006_jpdc_1997_1403 S0743731597914039
GroupedDBID	--K --M -~X .~1 1B1 1~. 1~5 29L 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABJNI ABMAC ABTAH ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADJOM ADMUD ADTZH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBOLZ HVGLF IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L OAUVE OZT P-9 P2P PC. Q38 R2- ROL RPZ SDF SDG SDP SES SPC SPCBC SST SSV SSZ T5K TN5 TWZ XOL XPP ZMT ZU3 ZY4 ~G- 0R~ 4.4 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABFSI ABWVN ABXDB ACLOT ACRPL ACVFH ADCNI ADHUB ADNMO ADVLN AEBSH AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS G-2 GBLVA HLZ HZ~ H~9 O9- P-8 SBC SET SEW WUQ ~HD AFXIZ AGCQF AGRNS BNPGV IQODW RIG SSH XJT
ID	FETCH-LOGICAL-c315t-e8224dc652c1d75ff276ab44b66eddb15d0ec6ee1505afd0032b819e84127df03
ISICitedReferencesCount	243
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000073243400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Mon Jul 21 09:17:52 EDT 2025 Tue Nov 18 22:38:59 EST 2025 Sat Nov 29 07:19:18 EST 2025 Fri Feb 23 02:27:55 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	numerical linear algebra parallel graph partitioning fill reducing ordering multilevel partitioning methods Partition Parallel algorithm Distributed memory multiprocessor system Numerical computation Algorithm performance Linear algebra Sparse matrix Graph theory Distributed system Experimental study
Language	English
License	CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c315t-e8224dc652c1d75ff276ab44b66eddb15d0ec6ee1505afd0032b819e84127df03
PageCount	25
ParticipantIDs	pascalfrancis_primary_2211418 crossref_primary_10_1006_jpdc_1997_1403 crossref_citationtrail_10_1006_jpdc_1997_1403 elsevier_sciencedirect_doi_10_1006_jpdc_1997_1403
PublicationCentury	1900
PublicationDate	1998-01-10
PublicationDateYYYYMMDD	1998-01-10
PublicationDate_xml	– month: 01 year: 1998 text: 1998-01-10 day: 10
PublicationDecade	1990
PublicationPlace	San Diego, CA
PublicationPlace_xml	– name: San Diego, CA
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	1998
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Karypis, Kumar (PC971403RF17) 1994 Kumar, Grama, Gupta, Karypis (PC971403RF19) 1994 Hendrickson, Leland (PC971403RF11) 1993 G. Karypis, V. Kumar, A fast and highly quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. Ponnusamy, Mansour, Choudhary, Fox (PC971403RF22) 1993 Savage, Wloka (PC971403RF26) 1991; 13 Fiduccia, Mattheyses (PC971403RF6) 1982 Simon, Teng (PC971403RF27) 1993 Bui, Jones (PC971403RF4) 1993 Karypis, Kumar (PC971403RF15) 1998; 48 Kernighan, Lin (PC971403RF18) 1970 Rothberg (PC971403RF25) May 1994 Karypis, Kumar (PC971403RF13) 1995 Liu (PC971403RF20) 1985; 11 Barnard, Simon (PC971403RF3) 1993 Pothen, Fan (PC971403RF23) 1990 George, Liu (PC971403RF8) 1981 Diniz, Plimpton, Henrickson, Leland (PC971403RF5) 1995 Barnard, Simon (PC971403RF2) 1995 Karypis, Kumar (PC971403RF14) 1996 S. T. Barnard, Pmrsb: Parallel multilevel recursive spectral bisection Hendrickson, Leland (PC971403RF12) 1993 Luby (PC971403RF21) 1986; 15 Raghavan (PC971403RF24) 1995 Supercomputing 1995 Garbers, Promel, Steger (PC971403RF7) 1990 Heath, Ng, Peyton (PC971403RF10) 1991; 33 Gupta, Karypis, Kumar (PC971403RF9) May 1997; 8 Fiduccia (10.1006/jpdc.1997.1403_PC971403RF6) 1982 Karypis (10.1006/jpdc.1997.1403_PC971403RF13) 1995 Karypis (10.1006/jpdc.1997.1403_PC971403RF15) 1998; 48 Ponnusamy (10.1006/jpdc.1997.1403_PC971403RF22) 1993 Bui (10.1006/jpdc.1997.1403_PC971403RF4) 1993 Pothen (10.1006/jpdc.1997.1403_PC971403RF23) 1990 Barnard (10.1006/jpdc.1997.1403_PC971403RF3) 1993 Gupta (10.1006/jpdc.1997.1403_PC971403RF9) 1997; 8 10.1006/jpdc.1997.1403_PC971403RF16 Hendrickson (10.1006/jpdc.1997.1403_PC971403RF11) 1993 Simon (10.1006/jpdc.1997.1403_PC971403RF27) 1993 Diniz (10.1006/jpdc.1997.1403_PC971403RF5) 1995 Karypis (10.1006/jpdc.1997.1403_PC971403RF17) 1994 Raghavan (10.1006/jpdc.1997.1403_PC971403RF24) 1995 Kernighan (10.1006/jpdc.1997.1403_PC971403RF18) 1970 George (10.1006/jpdc.1997.1403_PC971403RF8) 1981 Savage (10.1006/jpdc.1997.1403_PC971403RF26) 1991; 13 Kumar (10.1006/jpdc.1997.1403_PC971403RF19) 1994 Liu (10.1006/jpdc.1997.1403_PC971403RF20) 1985; 11 Karypis (10.1006/jpdc.1997.1403_PC971403RF14) 1996 Heath (10.1006/jpdc.1997.1403_PC971403RF10) 1991; 33 Hendrickson (10.1006/jpdc.1997.1403_PC971403RF12) 1993 10.1006/jpdc.1997.1403_PC971403RF1 Barnard (10.1006/jpdc.1997.1403_PC971403RF2) 1995 Rothberg (10.1006/jpdc.1997.1403_PC971403RF25) 1994 Luby (10.1006/jpdc.1997.1403_PC971403RF21) 1986; 15 Garbers (10.1006/jpdc.1997.1403_PC971403RF7) 1990
References_xml	– year: 1993 ident: PC971403RF12 article-title: A Multilevel Algorithm for Partitioning Graphs publication-title: Technical Report – year: May 1994 ident: PC971403RF25 article-title: Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers publication-title: Proceedings of the 1994 Scalable High Performance Computing Conference – year: 1993 ident: PC971403RF11 article-title: The Chaco User's Guide publication-title: Technical Report – year: 1970 ident: PC971403RF18 article-title: An efficient heuristic procedure for partitioning graphs publication-title: Bell Syst. Tech. J. – year: 1990 ident: PC971403RF23 article-title: Computing the block triangular form of a sparse matrix publication-title: ACM Trans. Math. Software – year: 1995 ident: PC971403RF2 article-title: A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes publication-title: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing – year: 1993 ident: PC971403RF3 article-title: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems publication-title: Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing – volume: 13 start-page: 257 year: 1991 end-page: 272 ident: PC971403RF26 article-title: Parallelism in graph partitioning publication-title: J. Parallel Distrib. Compt. – volume: 15 start-page: 1036 year: 1986 end-page: 1053 ident: PC971403RF21 article-title: A simple parallel algorithm for the maximal independent set problem publication-title: SIAM J. Comput. – reference: S. T. Barnard, Pmrsb: Parallel multilevel recursive spectral bisection, – volume: 33 start-page: 420 year: 1991 end-page: 460 ident: PC971403RF10 article-title: Parallel algorithms for sparse linear systems publication-title: SIAM Rev. – year: 1993 ident: PC971403RF27 article-title: How Good is Recursive Bisection? publication-title: Technical Report – volume: 8 start-page: 502 year: May 1997 end-page: 520 ident: PC971403RF9 article-title: Highly scalable parallel algorithms for sparse matrix factorization publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 48 start-page: 96 year: 1998 end-page: 129 ident: PC971403RF15 article-title: Multilevel publication-title: J. Parallel Distrib. Comput. – year: 1995 ident: PC971403RF5 article-title: Parallel algorithms for dynamically partitioning unstructured grids publication-title: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing – volume: 11 start-page: 141 year: 1985 end-page: 153 ident: PC971403RF20 article-title: Modification of the minimum degree algorithm by multiple elimination publication-title: ACM Trans. Math. Software – year: 1995 ident: PC971403RF13 article-title: Analysis of Multilevel Graph Partitioning publication-title: Technical Report – year: 1994 ident: PC971403RF19 publication-title: Introduction to Parallel Computing: Design and Analysis of Algorithms – year: 1981 ident: PC971403RF8 publication-title: Computer Solution of Large Sparse Positive Definite Systems – reference: G. Karypis, V. Kumar, A fast and highly quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. – year: 1993 ident: PC971403RF4 article-title: A heuristic for reducing fill in sparse matrix factorization publication-title: 6th SIAM Conf. Parallel Processing for Scientific Computing – year: 1982 ident: PC971403RF6 article-title: A linear time heuristic for improving network partitions publication-title: Proc. 19th IEEE Design Automation Conference – reference: , Supercomputing 1995 – year: 1990 ident: PC971403RF7 article-title: Finding clusters in VLSI circuits publication-title: Proceedings of IEEE International Conference on Computer Aided Design – year: 1994 ident: PC971403RF17 article-title: Fast Space Cholesky Factorization on Scalable Parallel Computers publication-title: Technical report – year: 1995 ident: PC971403RF24 article-title: Parallel Ordering Using Edge Contraction publication-title: Technical Report – year: 1993 ident: PC971403RF22 article-title: Graph contraction and physical optimization methods: A quality–cost tradeoff for mapping data on parallel computers publication-title: International Conference of Supercomputing – year: 1996 ident: PC971403RF14 article-title: Parallel Multilevel publication-title: Technical Report – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF4 article-title: A heuristic for reducing fill in sparse matrix factorization – volume: 8 start-page: 502 year: 1997 ident: 10.1006/jpdc.1997.1403_PC971403RF9 article-title: Highly scalable parallel algorithms for sparse matrix factorization publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.598277 – volume: 15 start-page: 1036 year: 1986 ident: 10.1006/jpdc.1997.1403_PC971403RF21 article-title: A simple parallel algorithm for the maximal independent set problem publication-title: SIAM J. Comput. doi: 10.1137/0215074 – year: 1995 ident: 10.1006/jpdc.1997.1403_PC971403RF24 article-title: Parallel Ordering Using Edge Contraction publication-title: Technical Report – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF12 article-title: A Multilevel Algorithm for Partitioning Graphs publication-title: Technical Report – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF22 article-title: Graph contraction and physical optimization methods: A quality–cost tradeoff for mapping data on parallel computers – volume: 13 start-page: 257 year: 1991 ident: 10.1006/jpdc.1997.1403_PC971403RF26 article-title: Parallelism in graph partitioning publication-title: J. Parallel Distrib. Compt. doi: 10.1016/0743-7315(91)90074-J – volume: 33 start-page: 420 year: 1991 ident: 10.1006/jpdc.1997.1403_PC971403RF10 article-title: Parallel algorithms for sparse linear systems publication-title: SIAM Rev. doi: 10.1137/1033099 – volume: 48 start-page: 96 year: 1998 ident: 10.1006/jpdc.1997.1403_PC971403RF15 article-title: Multilevelk publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1997.1404 – year: 1994 ident: 10.1006/jpdc.1997.1403_PC971403RF17 article-title: Fast Space Cholesky Factorization on Scalable Parallel Computers publication-title: Technical report – year: 1994 ident: 10.1006/jpdc.1997.1403_PC971403RF25 article-title: Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers – year: 1995 ident: 10.1006/jpdc.1997.1403_PC971403RF5 article-title: Parallel algorithms for dynamically partitioning unstructured grids – year: 1990 ident: 10.1006/jpdc.1997.1403_PC971403RF7 article-title: Finding clusters in VLSI circuits – year: 1996 ident: 10.1006/jpdc.1997.1403_PC971403RF14 article-title: Parallel Multilevelk publication-title: Technical Report – volume: 11 start-page: 141 year: 1985 ident: 10.1006/jpdc.1997.1403_PC971403RF20 article-title: Modification of the minimum degree algorithm by multiple elimination publication-title: ACM Trans. Math. Software doi: 10.1145/214392.214398 – ident: 10.1006/jpdc.1997.1403_PC971403RF16 – year: 1970 ident: 10.1006/jpdc.1997.1403_PC971403RF18 article-title: An efficient heuristic procedure for partitioning graphs publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1970.tb01770.x – year: 1995 ident: 10.1006/jpdc.1997.1403_PC971403RF2 article-title: A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes – year: 1990 ident: 10.1006/jpdc.1997.1403_PC971403RF23 article-title: Computing the block triangular form of a sparse matrix publication-title: ACM Trans. Math. Software doi: 10.1145/98267.98287 – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF27 article-title: How Good is Recursive Bisection? publication-title: Technical Report – ident: 10.1006/jpdc.1997.1403_PC971403RF1 doi: 10.1145/224170.224227 – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF3 article-title: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems – year: 1994 ident: 10.1006/jpdc.1997.1403_PC971403RF19 – year: 1981 ident: 10.1006/jpdc.1997.1403_PC971403RF8 – year: 1993 ident: 10.1006/jpdc.1997.1403_PC971403RF11 article-title: The Chaco User's Guide publication-title: Technical Report – year: 1982 ident: 10.1006/jpdc.1997.1403_PC971403RF6 article-title: A linear time heuristic for improving network partitions – year: 1995 ident: 10.1006/jpdc.1997.1403_PC971403RF13 article-title: Analysis of Multilevel Graph Partitioning publication-title: Technical Report
SSID	ssj0011578
Score	2.0089924
Snippet	In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	71
SubjectTerms	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology fill reducing ordering Information retrieval. Graph multilevel partitioning methods numerical linear algebra parallel graph partitioning Software Theoretical computing
Title	A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
URI	https://dx.doi.org/10.1006/jpdc.1997.1403
Volume	48
WOSCitedRecordID	wos000073243400004&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5BygEJ8UYUKNoDEofI4Mfu2j5aqIiCqErVSuFk2btrqBRcK3ZRfj4z-7BTogg4cLGijZ1N9vs8MxvPfEPIK6niKk5yETDJ84DxJgpyXkMgpzlrqkRGUmWm2UR6fJwtFvmJKyHoTTuBtG2z9Trv_ivUMAZgY-nsP8A9figMwGsAHY4AOxz_CvhijnLey6XG3ONvl7D5__7DJBOa3MElJgnNjUw1nmelinyhIliXVY8ZrcPqYj03qpzes23Hr9MscKVC_V1snaVNlVx3NfgL0ZgXp19PjkyO4NjJ69P55-J0SrJVUyEe5r5Nf4Y5z71hr1DtNE1sdaY3rizbIpG1lLbxivO5ts_mljUHi4DWvFMSiyrTN6gtOPkt_6z-N3c2JhnGsLdlUXaT7MUpz7MZ2SuODhcfx2dMEbd-2n9tL-kZirfXp9wVstzpqh5upMZ2QNkIS87uk7sOD1pYHjwgN3T7kNxzewvqLHcPQ759hx97RL4U1GNIR6ZQYAqdmEINU-gmUyjgTS1TqGUK9Ux5TM7fH569-xC4DhuBhB88BBpziJUUPJaRSnnTxKmoasZqIbRSdcRVqKXQGnYNvGoUeIC4hhBSZyyKU9WEyRMyay9b_ZTQNKxEFUpe1VKxmrO8YZmOlMh5okRSi30S-EUspZOfxy4oy9IKZ4sSF73ERS9x0ffJ6_H8zgqv7Dwz8piULmy04WAJPNp5zcE18MYpHGme_eH95-T2dE-8ILNhdaUPyC35c7joVy8d034BkySYbw
linkProvider	Elsevier
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=A+parallel+algorithm+for+multilevel+graph+partitioning+and+sparse+matrix+ordering&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=KARYPIS%2C+G&rft.au=KUMAR%2C+V&rft.date=1998-01-10&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=48&rft.issue=1&rft.spage=71&rft.epage=95&rft_id=info:doi/10.1006%2Fjpdc.1997.1403&rft.externalDBID=n%2Fa&rft.externalDocID=2211418
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon