{"id":"https://openalex.org/W1651579106","doi":"https://doi.org/10.1007/11534273_16","title":"Communication-Aware Processor Allocation for Supercomputers","display_name":"Communication-Aware Processor Allocation for Supercomputers","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1651579106","doi":"https://doi.org/10.1007/11534273_16","mag":"1651579106"},"language":"en","primary_location":{"id":"doi:10.1007/11534273_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5068761590","display_name":"Michael A. Bender","orcid":"https://orcid.org/0000-0001-7639-530X"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":["Department of Computer Science, SUNY Stony Brook, Stony Brook, NY, 11794-4400, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, SUNY Stony Brook, Stony Brook, NY, 11794-4400, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108523409","display_name":"David P. Bunde","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Bunde","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana, IL, 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, 02139, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["Dept. of Mathematical Optimization, Braunschweig University of Technology, 38106, Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematical Optimization, Braunschweig University of Technology, 38106, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032598206","display_name":"Vitus J. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vitus J. Leung","raw_affiliation_strings":["Discrete Algorithms & Math Department, Sandia National Laboratories, Albuquerque, NM, 87185-1110, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Algorithms & Math Department, Sandia National Laboratories, Albuquerque, NM, 87185-1110, USA","institution_ids":["https://openalex.org/I192454743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045375742","display_name":"Henk Meijer","orcid":"https://orcid.org/0000-0003-0406-3327"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Henk Meijer","raw_affiliation_strings":["Dept. of Computing and Information Science, Queen\u2019s University, Kingston, Ontario, K7L 3N6, Canada","Dept. of Computing and Information Science, Queen's University, Kingston, Ontario, K7L 3N6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computing and Information Science, Queen\u2019s University, Kingston, Ontario, K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]},{"raw_affiliation_string":"Dept. of Computing and Information Science, Queen's University, Kingston, Ontario, K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035120984","display_name":"Cynthia A. Phillips","orcid":"https://orcid.org/0000-0001-7348-9079"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia A. Phillips","raw_affiliation_strings":["Discrete Algorithms & Math Department, Sandia National Laboratories, Albuquerque, NM, 87185-1110, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Algorithms & Math Department, Sandia National Laboratories, Albuquerque, NM, 87185-1110, USA","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6427,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.8470205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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.6755068898200989},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6730237603187561},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6653474569320679},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6182281970977783},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5713943243026733},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5676197409629822},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5420113801956177},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49609026312828064},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4832645058631897},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4825593829154968},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4306792616844177},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41431093215942383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3688536286354065},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3571242690086365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30743640661239624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28425362706184387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2470637857913971},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06562381982803345},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.059318602085113525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755068898200989},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6730237603187561},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6653474569320679},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6182281970977783},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5713943243026733},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5676197409629822},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5420113801956177},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49609026312828064},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4832645058631897},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4825593829154968},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4306792616844177},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41431093215942383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3688536286354065},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3571242690086365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30743640661239624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28425362706184387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2470637857913971},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06562381982803345},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.059318602085113525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/11534273_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.127.6296","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.6296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://db.uwaterloo.ca/~eddemain/papers/MinAvgDistance_WADS2005/paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.5204","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.5204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://db.uwaterloo.ca/~eddemain/papers/MinAvgDistance_WADS2005/paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.9610","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.9610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://gaston.sandia.gov/cfupload/ccim_pubs_prod/Leung_2004_3562C.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.1164","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.1164","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/~bender/pub/algorithmica07-allocation.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.9715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.9715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graal.ens-lyon.fr/%7Eabenoit/CR02/papers/comm-aware.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.715.1641","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.715.1641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www3.cs.stonybrook.edu/%7Ebender/newpub/2005-BenderBuDe-wads-supercomputers.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.2237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.knox.edu/dbunde/pubs/proc-pairwise-wads.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1531168960","https://openalex.org/W1921984393","https://openalex.org/W1976008287","https://openalex.org/W1986053068","https://openalex.org/W1994698869","https://openalex.org/W1996431814","https://openalex.org/W2016568734","https://openalex.org/W2019874334","https://openalex.org/W2031701615","https://openalex.org/W2063545374","https://openalex.org/W2069932474","https://openalex.org/W2086917808","https://openalex.org/W2104691076","https://openalex.org/W2109067131","https://openalex.org/W2115788285","https://openalex.org/W2116249159","https://openalex.org/W2132989895","https://openalex.org/W2140633445","https://openalex.org/W2141585031","https://openalex.org/W2143300547","https://openalex.org/W2146547514","https://openalex.org/W2147586798","https://openalex.org/W2745300566","https://openalex.org/W2912511947","https://openalex.org/W3107081717"],"related_works":["https://openalex.org/W2167596143","https://openalex.org/W1694364829","https://openalex.org/W3126626577","https://openalex.org/W1903284337","https://openalex.org/W4385890265","https://openalex.org/W22428745","https://openalex.org/W1483588325","https://openalex.org/W3025482998","https://openalex.org/W2992207127","https://openalex.org/W2059001284"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}