{"id":"https://openalex.org/W4364322167","doi":"https://doi.org/10.1109/tsusc.2023.3263172","title":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","display_name":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","publication_year":2023,"publication_date":"2023-04-10","ids":{"openalex":"https://openalex.org/W4364322167","doi":"https://doi.org/10.1109/tsusc.2023.3263172"},"language":"en","primary_location":{"id":"doi:10.1109/tsusc.2023.3263172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsusc.2023.3263172","pdf_url":null,"source":{"id":"https://openalex.org/S4210221417","display_name":"IEEE Transactions on Sustainable Computing","issn_l":"2377-3782","issn":["2377-3782","2377-3790"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Sustainable Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082993401","display_name":"Baixuan Wu","orcid":"https://orcid.org/0000-0002-7380-8997"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baixuan Wu","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"],"raw_orcid":"https://orcid.org/0000-0002-7380-8997","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050795985","display_name":"Zheng Xiao","orcid":"https://orcid.org/0000-0003-1144-7599"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheng Xiao","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"],"raw_orcid":"https://orcid.org/0000-0003-1144-7599","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084211536","display_name":"Pei-Ying Lin","orcid":"https://orcid.org/0000-0002-8118-9700"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peiying Lin","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"],"raw_orcid":"https://orcid.org/0000-0002-8118-9700","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008574161","display_name":"Zhuo Tang","orcid":"https://orcid.org/0000-0001-9081-8153"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhuo Tang","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"],"raw_orcid":"https://orcid.org/0000-0001-9081-8153","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078793726","display_name":"Kenli Li","orcid":"https://orcid.org/0000-0002-2635-7716"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kenli Li","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"],"raw_orcid":"https://orcid.org/0000-0002-2635-7716","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1044,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76801719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"8","issue":"3","first_page":"412","last_page":"422"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.7416504621505737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6600574851036072},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.6599656343460083},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4933091700077057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45725932717323303},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.45104172825813293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42015552520751953},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4155222177505493},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34558868408203125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2488599419593811},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.13779237866401672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0966552197933197},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07197195291519165}],"concepts":[{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7416504621505737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6600574851036072},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.6599656343460083},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4933091700077057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45725932717323303},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.45104172825813293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42015552520751953},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4155222177505493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34558868408203125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2488599419593811},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.13779237866401672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0966552197933197},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07197195291519165},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsusc.2023.3263172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsusc.2023.3263172","pdf_url":null,"source":{"id":"https://openalex.org/S4210221417","display_name":"IEEE Transactions on Sustainable Computing","issn_l":"2377-3782","issn":["2377-3782","2377-3790"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Sustainable Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4671471653","display_name":null,"funder_award_id":"62172151","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W96060697","https://openalex.org/W1538070674","https://openalex.org/W1966461475","https://openalex.org/W1981893977","https://openalex.org/W1984283136","https://openalex.org/W2002292054","https://openalex.org/W2003177089","https://openalex.org/W2014875556","https://openalex.org/W2032145219","https://openalex.org/W2066308383","https://openalex.org/W2086539288","https://openalex.org/W2101267973","https://openalex.org/W2142535891","https://openalex.org/W2145374351","https://openalex.org/W2147071478","https://openalex.org/W2161125053","https://openalex.org/W2169647400","https://openalex.org/W2218880787","https://openalex.org/W2475714590","https://openalex.org/W2755090716","https://openalex.org/W2889833989","https://openalex.org/W2920703887","https://openalex.org/W2945118073","https://openalex.org/W2954427512","https://openalex.org/W3043020853","https://openalex.org/W3104001151","https://openalex.org/W3105202247","https://openalex.org/W3128350060","https://openalex.org/W3137027499","https://openalex.org/W3173953560","https://openalex.org/W3182769310","https://openalex.org/W3215333970","https://openalex.org/W6760463152","https://openalex.org/W6786068067"],"related_works":["https://openalex.org/W2583811263","https://openalex.org/W3173312668","https://openalex.org/W2810695303","https://openalex.org/W3012931947","https://openalex.org/W2585768449","https://openalex.org/W2035944803","https://openalex.org/W1763745677","https://openalex.org/W4242714385","https://openalex.org/W4254753700","https://openalex.org/W2913565981"],"abstract_inverted_index":{"Graph":[0],"partitioning":[1,101,126,188,196],"is":[2,41,181,203],"one":[3],"of":[4,18,32,38,56,70,83,91,119,179,217],"the":[5,16,29,33,42,46,57,62,66,80,84,88,92,116,125,143,148,177,194,198,215,227],"fundamental":[6],"problems":[7],"in":[8,124],"many":[9],"graph-based":[10],"applications":[11],"and":[12,110,146,161,223],"systems.":[13],"It":[14],"enables":[15],"division":[17],"a":[19,39,114,134],"graph":[20,40,58,85,93,100,152],"into":[21,176],"smaller":[22],"sub-graphs":[23],"for":[24,193],"subsequent":[25],"parallel":[26],"processing,":[27],"reducing":[28],"processing":[30,54,81,149],"latency":[31,150],"graph.":[34],"The":[35,53,168],"critical":[36,67,89,117,135,144,162,173,199,208,236],"path":[37,44,90,136,163,174,200,237],"logical":[43],"with":[45,73],"longest":[47],"delay":[48,63],"from":[49,94,210],"input":[50],"to":[51,99,141,205,231],"output.":[52],"time":[55,82],"mainly":[59],"depends":[60],"on":[61,104,220],"incurred":[64],"by":[65,86,239],"path,":[68],"independent":[69],"other":[71],"paths":[72,118,145,209],"small":[74],"delays.":[75],"Therefore,":[76],"it":[77],"can":[78],"reduce":[79],"protecting":[87],"partition.":[95],"However,":[96],"existing":[97],"approaches":[98],"only":[102],"focus":[103],"metrics":[105],"such":[106],"as":[107,183],"minimum":[108],"cut":[109],"partition":[111],"balance.":[112],"As":[113],"result,":[115],"graphs":[120],"may":[121],"be":[122],"destroyed":[123],"procedure.":[127],"To":[128],"address":[129],"this":[130],"problem,":[131],"we":[132],"present":[133],"awareness":[137],"approach,":[138],"namely":[139],"path-metis,":[140,155],"protect":[142,207],"alleviate":[147],"after":[151],"partitioning.":[153],"In":[154],"two":[156],"efficient":[157],"strategies,":[158,165],"including":[159],"Slack":[160,169],"fix":[164,201],"are":[166],"introduced.":[167],"strategy,":[170],"which":[171],"incorporates":[172],"information":[175],"weights":[178],"DAG,":[180],"used":[182],"pre-processing":[184],"before":[185],"traditional":[186],"multi-level":[187],"methods,":[189],"like":[190],"Metis.":[191],"Then,":[192],"generated":[195],"scheme,":[197],"strategy":[202],"proposed":[204],"further":[206],"being":[211],"cut.":[212],"We":[213],"demonstrate":[214],"effectiveness":[216],"our":[218,233],"approach":[219],"both":[221],"real":[222],"synthetic":[224],"datasets.":[225],"From":[226],"experimental":[228],"results,":[229],"compared":[230],"Metis,":[232],"method":[234],"improves":[235],"performance":[238],"17.70%.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}