{"id":"https://openalex.org/W2940611115","doi":"https://doi.org/10.1145/3313276.3316342","title":"Achieving optimal backlog in multi-processor cup games","display_name":"Achieving optimal backlog in multi-processor cup games","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2940611115","doi":"https://doi.org/10.1145/3313276.3316342","mag":"2940611115"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316342","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316342","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316342","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316342","any_repository_has_fulltext":true},"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":true,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":["Stony Brook University, USA"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087023890","display_name":"Mart\u0131\u0301n Farach-Colton","orcid":"https://orcid.org/0000-0003-3616-7788"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mart\u00edn Farach-Colton","raw_affiliation_strings":["Rutgers University, USA","Rutgers University , USA"],"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University , USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005111940","display_name":"William Kuszmaul","orcid":"https://orcid.org/0000-0002-3855-3036"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Kuszmaul","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","Massachusetts Institute of Technology , USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology , USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068761590"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04332478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1148","last_page":"1157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9991999864578247,"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.9988999962806702,"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/scheduling","display_name":"Scheduling (production processes)","score":0.626915693283081},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5979149341583252},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5883709192276001},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4933551847934723},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45640385150909424},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4403209686279297},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4200974702835083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3583317995071411},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3274412453174591},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31299883127212524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2719999849796295},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07982340455055237}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.626915693283081},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5979149341583252},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5883709192276001},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4933551847934723},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45640385150909424},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4403209686279297},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4200974702835083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3583317995071411},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3274412453174591},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31299883127212524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2719999849796295},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07982340455055237},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3313276.3316342","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316342","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316342","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1904.02861","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.02861","pdf_url":"https://arxiv.org/pdf/1904.02861","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2940611115","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1904.02861","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1904.02861","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1904.02861","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316342","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316342","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316342","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Clean water and sanitation","id":"https://metadata.un.org/sdg/6","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G1369922885","display_name":"CCF-BSF: AF: Small: Collaborative Research: The Dictionary Problem Considered","funder_award_id":"1716252","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1789788648","display_name":"AF: Small: Collaborative Research: Maintaining Order","funder_award_id":"1617618","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2963653684","display_name":"SPX: Collaborative Research: Harnessing the Power of High-Bandwidth Memory via Provably Efficient Parallel Algorithms","funder_award_id":"1725543","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3099827749","display_name":"CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System","funder_award_id":"1408695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3146337093","display_name":"CSR: Medium: Approximate Membership Query Data Structures in Computational Biology and Storage","funder_award_id":"1763680","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4926662827","display_name":"XPS: FULL: CCA: Collaborative Research: Cache-Adaptive Algorithms: How to Share Core among Many Cores","funder_award_id":"1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5338205543","display_name":null,"funder_award_id":"1314547","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5435976661","display_name":"CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System","funder_award_id":"1755615","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6188232864","display_name":null,"funder_award_id":"1533644","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2940611115.pdf","grobid_xml":"https://content.openalex.org/works/W2940611115.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W164930620","https://openalex.org/W1492077731","https://openalex.org/W1628974215","https://openalex.org/W1884472997","https://openalex.org/W1935687795","https://openalex.org/W1980436314","https://openalex.org/W1998014198","https://openalex.org/W1998482902","https://openalex.org/W2003523151","https://openalex.org/W2010063782","https://openalex.org/W2025470700","https://openalex.org/W2026511056","https://openalex.org/W2039208882","https://openalex.org/W2041645394","https://openalex.org/W2051392328","https://openalex.org/W2056830486","https://openalex.org/W2068871408","https://openalex.org/W2071083751","https://openalex.org/W2083865199","https://openalex.org/W2097145526","https://openalex.org/W2104338317","https://openalex.org/W2109764872","https://openalex.org/W2111046894","https://openalex.org/W2115728443","https://openalex.org/W2120234059","https://openalex.org/W2127087946","https://openalex.org/W2160702061","https://openalex.org/W2165659786","https://openalex.org/W2169152518","https://openalex.org/W2568208948","https://openalex.org/W2721925531","https://openalex.org/W2811066438","https://openalex.org/W2989661724"],"related_works":["https://openalex.org/W2964054046","https://openalex.org/W3135665665","https://openalex.org/W2949613217","https://openalex.org/W2943947403","https://openalex.org/W38155029","https://openalex.org/W1965725119","https://openalex.org/W2060640049","https://openalex.org/W2951536838","https://openalex.org/W1618165415","https://openalex.org/W2795341956","https://openalex.org/W2011643166","https://openalex.org/W2949560900","https://openalex.org/W1964121678","https://openalex.org/W2810121807","https://openalex.org/W2159036178","https://openalex.org/W2168012204","https://openalex.org/W2949594376","https://openalex.org/W2963926037","https://openalex.org/W1994047608","https://openalex.org/W3132031103"],"abstract_inverted_index":{"Many":[0],"problems":[1],"in":[2],"processor":[3],"scheduling,":[4],"deamortization,":[5],"and":[6,14],"buffer":[7],"management":[8],"can":[9],"be":[10],"modeled":[11],"as":[12],"single-":[13],"multi-processor":[15],"cup":[16],"games.":[17]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}