{"id":"https://openalex.org/W2962981407","doi":"https://doi.org/10.1145/3409667","title":"Better Process Mapping and Sparse Quadratic Assignment","display_name":"Better Process Mapping and Sparse Quadratic Assignment","publication_year":2020,"publication_date":"2020-09-30","ids":{"openalex":"https://openalex.org/W2962981407","doi":"https://doi.org/10.1145/3409667","mag":"2962981407"},"language":"en","primary_location":{"id":"doi:10.1145/3409667","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409667","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5043689301","display_name":"Konrad von Kirchbach","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Konrad Von Kirchbach","raw_affiliation_strings":["TU Wien, Faculty of Informatics, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Faculty of Informatics, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["University of Vienna, Faculty of Computer Science, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-2823-3506","affiliations":[{"raw_affiliation_string":"University of Vienna, Faculty of Computer Science, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064279948","display_name":"Jesper Larsson Tr\u00e4ff","orcid":"https://orcid.org/0000-0002-4864-9226"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Jesper Larsson Tr\u00e4ff","raw_affiliation_strings":["TU Wien, Faculty of Informatics, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Faculty of Informatics, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043689301"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.6474,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70707167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":null,"first_page":"1","last_page":"19"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7527037858963013},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5618976354598999},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5170965194702148},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5146216154098511},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48048296570777893},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47654134035110474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4712153971195221},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4490811824798584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44859257340431213},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.43269747495651245},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4169556796550751},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4118524491786957},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38354140520095825},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.32861781120300293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17705020308494568}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7527037858963013},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5618976354598999},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5170965194702148},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5146216154098511},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48048296570777893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47654134035110474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4712153971195221},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4490811824798584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44859257340431213},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.43269747495651245},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4169556796550751},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4118524491786957},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38354140520095825},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32861781120300293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17705020308494568},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3409667","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409667","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2497131470","display_name":null,"funder_award_id":"SA 933/11-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G478808154","display_name":null,"funder_award_id":"P 31763-N31","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W106431406","https://openalex.org/W324754135","https://openalex.org/W1499467741","https://openalex.org/W1575424854","https://openalex.org/W1756027381","https://openalex.org/W1852055750","https://openalex.org/W1910515323","https://openalex.org/W1973396420","https://openalex.org/W1978262702","https://openalex.org/W1989826169","https://openalex.org/W2004951603","https://openalex.org/W2035080386","https://openalex.org/W2051275999","https://openalex.org/W2070232376","https://openalex.org/W2077240465","https://openalex.org/W2086917808","https://openalex.org/W2130822890","https://openalex.org/W2137120608","https://openalex.org/W2291499491","https://openalex.org/W2918921976","https://openalex.org/W3009233884","https://openalex.org/W4211036892","https://openalex.org/W4232913067","https://openalex.org/W4254514041"],"related_works":["https://openalex.org/W1967627035","https://openalex.org/W2765352472","https://openalex.org/W2119821807","https://openalex.org/W4294734199","https://openalex.org/W1509211761","https://openalex.org/W1869243490","https://openalex.org/W2391299576","https://openalex.org/W2319467001","https://openalex.org/W1588481459","https://openalex.org/W3112909468"],"abstract_inverted_index":{"Communication":[0],"and":[1,35,46,64,73,98,121],"topology-aware":[2],"process":[3],"mapping":[4],"is":[5,158],"a":[6,30,112],"powerful":[7,82],"approach":[8],"to":[9,38,44,51,111,132,152,179],"reduce":[10],"communication":[11,18,71,76,102,155],"time":[12,126,130],"in":[13,105,135,187],"parallel":[14],"applications":[15,63],"with":[16],"known":[17],"patterns":[19,72],"on":[20],"large,":[21],"distributed":[22],"memory":[23],"systems.":[24],"We":[25,108,147],"address":[26],"the":[27,54,100,124,129,136,154,161,180],"problem":[28,33],"as":[29,69,138,140],"quadratic":[31],"assignment":[32,137],"(QAP)":[34],"present":[36,109],"algorithms":[37,50,83,91,151,168],"construct":[39],"initial":[40],"mappings":[41],"of":[42,116],"processes":[43],"processors":[45],"fast":[47],"local":[48,113,144,174],"search":[49,114,145,175],"further":[52,122],"improve":[53],"mappings.":[55],"By":[56],"exploiting":[57],"assumptions":[58],"that":[59,157,166],"typically":[60],"hold":[61],"for":[62,84],"modern":[65],"supercomputer":[66],"systems":[67],"such":[68],"sparse":[70],"hierarchically":[74],"organized":[75],"systems,":[77],"we":[78],"obtain":[79],"significantly":[80],"more":[81],"these":[85],"special":[86],"QAPs.":[87],"Our":[88],"multilevel":[89,181],"construction":[90],"employ":[92],"perfectly":[93],"balanced":[94],"graph":[95,156],"partitioning":[96],"techniques":[97],"exploit":[99],"given":[101],"system":[103],"hierarchy":[104],"significant":[106],"ways.":[107],"improvements":[110],"algorithm":[115],"Brandfass":[117],"et":[118],"al.":[119],"(2013)":[120],"decrease":[123],"running":[125],"by":[127,141],"reducing":[128],"needed":[131],"perform":[133],"swaps":[134],"well":[139],"carefully":[142],"constraining":[143],"neighborhoods.":[146],"also":[148],"investigate":[149],"different":[150],"create":[153],"mapped":[159],"onto":[160],"processor":[162],"network.":[163],"Experiments":[164],"indicate":[165],"our":[167],"not":[169],"only":[170],"dramatically":[171],"speed":[172],"up":[173],"but":[176],"also,":[177],"due":[178],"approach,":[182],"find":[183],"much":[184],"better":[185],"solutions":[186],"practice.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}