{"id":"https://openalex.org/W4312454597","doi":"https://doi.org/10.1109/cluster51413.2022.00057","title":"Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping","display_name":"Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping","publication_year":2022,"publication_date":"2022-09-01","ids":{"openalex":"https://openalex.org/W4312454597","doi":"https://doi.org/10.1109/cluster51413.2022.00057"},"language":"en","primary_location":{"id":"doi:10.1109/cluster51413.2022.00057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster51413.2022.00057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Cluster Computing (CLUSTER)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5007475511","display_name":"Marcelo Fonseca Faraj","orcid":"https://orcid.org/0000-0001-7100-236X"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marcelo Fonseca Faraj","raw_affiliation_strings":["Heidelberg University,Heidelberg,Germany","Heidelberg University, Heidelberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heidelberg University,Heidelberg,Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["Heidelberg University,Heidelberg,Germany","Heidelberg University, Heidelberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heidelberg University,Heidelberg,Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I223822909"],"apc_list":null,"apc_paid":null,"fwci":1.0784,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74869964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"473","last_page":"483"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.9994999766349792,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7809866070747375},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6815156936645508},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.547116756439209},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4825436472892761},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46467500925064087},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45987576246261597},{"id":"https://openalex.org/keywords/on-the-fly","display_name":"On the fly","score":0.4486812651157379}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7809866070747375},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6815156936645508},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.547116756439209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4825436472892761},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46467500925064087},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45987576246261597},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.4486812651157379},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cluster51413.2022.00057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster51413.2022.00057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Cluster Computing (CLUSTER)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W2067902980","https://openalex.org/W1504320321","https://openalex.org/W4312275919","https://openalex.org/W2338293335","https://openalex.org/W2039378765","https://openalex.org/W2613115449","https://openalex.org/W3150408542","https://openalex.org/W2548529098"],"abstract_inverted_index":{"Partitioning":[0],"a":[1,14,26,50,65,77,103],"graph":[2,44,71,95,143],"into":[3],"balanced":[4],"blocks":[5,12],"such":[6],"that":[7,32,126],"few":[8],"edges":[9,163],"run":[10],"between":[11],"is":[13,52,106,109,129,147],"key":[15],"problem":[16],"for":[17,92],"large-scale":[18],"distributed":[19,104],"processing.":[20],"In":[21,140],"this":[22],"work,":[23],"we":[24],"present":[25],"shared-memory":[27],"streaming":[28],"multi-recursive":[29],"partitioning":[30,72,89,96],"scheme":[31],"performs":[33],"re-cursive":[34],"multi-sections":[35],"on":[36],"the":[37,41,69,93,100,114,156],"fly":[38],"without":[39],"knowing":[40],"overall":[42],"input":[43],"to":[45,67,111,149,165],"compute":[46],"hierarchical":[47],"partitionings.":[48],"If":[49],"hierarchy":[51],"not":[53],"specified":[54],"as":[55,64],"an":[56],"input,":[57],"our":[58,127,145],"approach":[59,75],"can":[60],"also":[61],"be":[62],"used":[63],"tool":[66],"solve":[68],"standard":[70],"problem.":[73],"Our":[74,123],"has":[76],"considerably":[78],"lower":[79],"running":[80],"time":[81],"complexity":[82],"in":[83],"comparison":[84],"with":[85],"state-of-the-art":[86],"non-buffered":[87],"one-pass":[88],"algorithms":[90],"designed":[91],"non-hierarchical":[94],"case.":[97],"More-over,":[98],"if":[99],"topology":[101],"of":[102,142,152,158],"system":[105],"known,":[107],"it":[108],"possible":[110],"further":[112],"optimize":[113],"communication":[115],"costs":[116],"by":[117],"mapping":[118],"partitions":[119],"onto":[120],"processing":[121],"elements.":[122],"experiments":[124],"indicate":[125],"algorithm":[128],"both":[130],"faster":[131,154],"and":[132],"produces":[133],"better":[134],"process":[135],"mappings":[136],"than":[137],"competing":[138],"tools.":[139],"case":[141],"partitioning,":[144],"framework":[146],"up":[148],"two":[150],"orders":[151],"magnitude":[153],"at":[155],"cost":[157],"5":[159],"%":[160],"more":[161],"cut":[162],"compared":[164],"Fennel.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}