{"id":"https://openalex.org/W2127101191","doi":"https://doi.org/10.1145/2612669.2612699","title":"Hierarchical graph partitioning","display_name":"Hierarchical graph partitioning","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2127101191","doi":"https://doi.org/10.1145/2612669.2612699","mag":"2127101191"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612699","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-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/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammadtaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103350641","display_name":"Theodore Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Theodore Johnson","raw_affiliation_strings":["AT&T Research Laboratory, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Research Laboratory, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080863479","display_name":"Mohammad Reza Khani","orcid":"https://orcid.org/0000-0001-7753-1780"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Reza Khani","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barna Saha","raw_affiliation_strings":["AT&T Research Laboratory, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Research Laboratory, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111876448"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.3448,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.67754326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.8314522504806519},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5990882515907288},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5943576693534851},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5664480924606323},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5074772238731384},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.49055856466293335},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4867594242095947},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4824807941913605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4468272924423218},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4450843334197998},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42147135734558105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.361831933259964},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.26118019223213196},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24020138382911682},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14777666330337524},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1467723846435547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12521028518676758}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8314522504806519},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5990882515907288},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5943576693534851},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5664480924606323},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5074772238731384},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.49055856466293335},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4867594242095947},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4824807941913605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4468272924423218},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4450843334197998},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42147135734558105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.361831933259964},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.26118019223213196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24020138382911682},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14777666330337524},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1467723846435547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12521028518676758},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2612669.2612699","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W110441439","https://openalex.org/W1538076361","https://openalex.org/W1553541948","https://openalex.org/W1571037334","https://openalex.org/W1738738076","https://openalex.org/W1971758446","https://openalex.org/W1972149001","https://openalex.org/W2000835972","https://openalex.org/W2005148804","https://openalex.org/W2014071862","https://openalex.org/W2020140168","https://openalex.org/W2034674913","https://openalex.org/W2038919928","https://openalex.org/W2053819681","https://openalex.org/W2061130579","https://openalex.org/W2064570018","https://openalex.org/W2087879219","https://openalex.org/W2088844265","https://openalex.org/W2108392406","https://openalex.org/W2113513143","https://openalex.org/W2121253712","https://openalex.org/W2129027842","https://openalex.org/W2131239319","https://openalex.org/W2149413963","https://openalex.org/W2150148016","https://openalex.org/W2151334846","https://openalex.org/W2159844592","https://openalex.org/W2161678741","https://openalex.org/W2161719898","https://openalex.org/W2169528477","https://openalex.org/W4285719527","https://openalex.org/W6644753910"],"related_works":["https://openalex.org/W2563943286","https://openalex.org/W4229495955","https://openalex.org/W2118368532","https://openalex.org/W2128410848","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2096289371","https://openalex.org/W2143229379","https://openalex.org/W2130555437"],"abstract_inverted_index":{"One":[0],"of":[1,13,56,65,81,89],"the":[2,11,30,62,66,71],"important":[3],"optimization":[4,79],"questions":[5],"in":[6],"highly":[7],"parallel":[8],"systems":[9],"is":[10],"problem":[12],"assigning":[14],"computational":[15],"resources":[16,27,43],"to":[17,25,41,58],"communicating":[18],"tasks.":[19],"While":[20],"scheduling":[21],"tasks/operators,":[22],"tasks":[23,39],"assigned":[24,40],"nearby":[26],"(e.g.":[28,44],"on":[29,45],"same":[31],"CPU":[32],"core)":[33],"have":[34,49],"low":[35],"communication":[36,51,63,83],"costs,":[37],"whereas":[38],"distant":[42],"different":[46],"server":[47],"racks)":[48],"high":[50],"costs.":[52],"An":[53],"optimal":[54],"solution":[55],"task":[57,67],"resource":[59],"assignment":[60],"minimizes":[61],"cost":[64,84],"ensemble":[68],"while":[69],"satisfying":[70],"load":[72],"balancing":[73],"requirements.":[74],"We":[75],"model":[76],"such":[77],"an":[78],"question":[80],"minimizing":[82],"as":[85],"a":[86],"new":[87],"class":[88],"graph":[90,95],"partitioning":[91],"problems":[92],"called":[93],"hierarchical":[94],"partitioning.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}