{"id":"https://openalex.org/W4285007338","doi":"https://doi.org/10.1145/3490148.3538577","title":"Online Parallel Paging with Optimal Makespan","display_name":"Online Parallel Paging with Optimal Makespan","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285007338","doi":"https://doi.org/10.1145/3490148.3538577"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538577","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538577","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035990793","display_name":"Kunal Agrawal","orcid":"https://orcid.org/0000-0001-5882-6647"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kunal Agrawal","raw_affiliation_strings":["Washington University in St. Louis, St. Louis, MO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis, St. Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","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":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020629410","display_name":"Rathish Das","orcid":"https://orcid.org/0000-0002-2416-6422"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Rathish Das","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005111940","display_name":"William Kuszmaul","orcid":"https://orcid.org/0000-0002-3855-3036"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Kuszmaul","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023594436","display_name":"Enoch Peserico","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enoch Peserico","raw_affiliation_strings":["Universit\u00e0 degli Studi di Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072734392","display_name":"Michele Scquizzato","orcid":"https://orcid.org/0000-0002-9108-2448"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Michele Scquizzato","raw_affiliation_strings":["Universit\u00e0 degli Studi di Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5035990793"],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":0.713,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71477886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9896000027656555,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.9780968427658081},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8383950591087341},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7576476335525513},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6745275855064392},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5636751651763916},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5516852736473083},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5330364108085632},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5213238596916199},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5207117199897766},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5052555203437805},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.46549734473228455},{"id":"https://openalex.org/keywords/page-cache","display_name":"Page cache","score":0.44697535037994385},{"id":"https://openalex.org/keywords/demand-paging","display_name":"Demand paging","score":0.42909806966781616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2580187916755676},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25009793043136597},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2250899374485016},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.20180845260620117},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1621706783771515},{"id":"https://openalex.org/keywords/virtual-memory","display_name":"Virtual memory","score":0.15393540263175964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10132130980491638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06488034129142761}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9780968427658081},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8383950591087341},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7576476335525513},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6745275855064392},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5636751651763916},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5516852736473083},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5330364108085632},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5213238596916199},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5207117199897766},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5052555203437805},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.46549734473228455},{"id":"https://openalex.org/C36340418","wikidata":"https://www.wikidata.org/wiki/Q7124288","display_name":"Page cache","level":5,"score":0.44697535037994385},{"id":"https://openalex.org/C188873839","wikidata":"https://www.wikidata.org/wiki/Q5255045","display_name":"Demand paging","level":5,"score":0.42909806966781616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2580187916755676},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25009793043136597},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2250899374485016},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.20180845260620117},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1621706783771515},{"id":"https://openalex.org/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.15393540263175964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10132130980491638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06488034129142761},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3490148.3538577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538577","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146373","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146373","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:www.research.unipd.it:11577/3452884","is_oa":true,"landing_page_url":"http://hdl.handle.net/11577/3452884","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3490148.3538577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538577","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G1220711003","display_name":null,"funder_award_id":"CCF-2106699, CCF-1733873, SPX-1725647, CCF-2106827, CSR-1763680, CCF-1716252, CNS-1938709, CCF-1725543, GRFP Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G1390987118","display_name":null,"funder_award_id":"CNS-1938709","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2673416368","display_name":null,"funder_award_id":"CCF-1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2902473203","display_name":null,"funder_award_id":"CCF-1725543","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/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/G3868869440","display_name":null,"funder_award_id":"CCF-2106827","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5329322851","display_name":null,"funder_award_id":"232/2016","funder_id":"https://openalex.org/F4320317295","funder_display_name":"Dipartimenti di Eccellenza"},{"id":"https://openalex.org/G5375430649","display_name":null,"funder_award_id":"BIRD197859/19","funder_id":"https://openalex.org/F4320321966","funder_display_name":"Universit\u00e0 degli Studi di Padova"},{"id":"https://openalex.org/G5417130124","display_name":null,"funder_award_id":"232/2016","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G5464415299","display_name":null,"funder_award_id":"2118832","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6076212696","display_name":null,"funder_award_id":"2106827","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6681485391","display_name":"SPX: Collaborative Research: Eat your Wheaties: Multi-Grain Compilers for Parallel Builds at Every Scale","funder_award_id":"1725647","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6752627479","display_name":null,"funder_award_id":"L. 232/2016","funder_id":"https://openalex.org/F4320317295","funder_display_name":"Dipartimenti di Eccellenza"},{"id":"https://openalex.org/G7097317338","display_name":null,"funder_award_id":"CSR-1763680","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7361967927","display_name":"AITF: Applied Algorithmic Foundation for Scheduling Multiprogrammed Parallelizable Workloads","funder_award_id":"1733873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7510981485","display_name":null,"funder_award_id":"CCF-2118832","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7647474342","display_name":null,"funder_award_id":"FA8750-19-2-1000","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G7792359867","display_name":"Collaborative Research: AF: Medium: Adventures in Flatland: Algorithms for Modern Memories","funder_award_id":"2106699","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7915489987","display_name":null,"funder_award_id":"L. 232","funder_id":"https://openalex.org/F4320317295","funder_display_name":"Dipartimenti di Eccellenza"},{"id":"https://openalex.org/G7964149644","display_name":null,"funder_award_id":"FA8750-19-2-1000","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"},{"id":"https://openalex.org/G8239798060","display_name":null,"funder_award_id":"1938709","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8917628870","display_name":null,"funder_award_id":"L. 232/2016","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"},{"id":"https://openalex.org/F4320309650","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268"},{"id":"https://openalex.org/F4320317295","display_name":"Dipartimenti di Eccellenza","ror":null},{"id":"https://openalex.org/F4320320994","display_name":"Canada Research Chairs","ror":"https://ror.org/0517h6h17"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320321966","display_name":"Universit\u00e0 degli Studi di Padova","ror":"https://ror.org/00240q980"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285007338.pdf","grobid_xml":"https://content.openalex.org/works/W4285007338.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1710577061","https://openalex.org/W1983997639","https://openalex.org/W1987225815","https://openalex.org/W2019131264","https://openalex.org/W2041645394","https://openalex.org/W2048720850","https://openalex.org/W2112814927","https://openalex.org/W2140041027","https://openalex.org/W2164705534","https://openalex.org/W2472660561","https://openalex.org/W2997918921","https://openalex.org/W3041837310","https://openalex.org/W3041850557","https://openalex.org/W3097002536","https://openalex.org/W3116040173","https://openalex.org/W3121437753","https://openalex.org/W4239293572","https://openalex.org/W4285013708","https://openalex.org/W6631155002"],"related_works":["https://openalex.org/W2617423316","https://openalex.org/W2054033098","https://openalex.org/W2168823865","https://openalex.org/W1602169857","https://openalex.org/W4254437281","https://openalex.org/W1998843748","https://openalex.org/W1009057809","https://openalex.org/W2128493660","https://openalex.org/W1979064639","https://openalex.org/W2021315586"],"abstract_inverted_index":{"The":[0],"classical":[1,137],"paging":[2,52,118,147],"problem":[3,53,86],"can":[4,13],"be":[5],"described":[6],"as":[7,35,45,47],"follows:":[8],"given":[9,89],"a":[10,22,105],"cache":[11,33,65,122],"that":[12,149],"hold":[14],"up":[15],"to":[16,26,36,123,143],"k":[17],"pages":[18],"(or":[19],"blocks)":[20],"and":[21,110],"sequence":[23,44,75],"of":[24,76,102,108,128],"requests":[25],"pages,":[27,109],"how":[28,115],"should":[29,116],"we":[30,87,111],"manage":[31,120],"the":[32,43,60,64,113,117,121,125,132,136,140],"so":[34],"maximize":[37],"performance-or,":[38],"in":[39],"other":[40],"words,":[41],"complete":[42],"quickly":[46],"possible.":[48],"Whereas":[49],"this":[50,85],"sequential":[51,138],"has":[54,79],"been":[55,80],"well":[56],"understood":[57],"for":[58,135],"decades,":[59],"parallel":[61],"version,":[62],"where":[63],"is":[66,142],"shared":[67],"among":[68],"p":[69,90],"processors":[70],"each":[71,101],"issuing":[72],"its":[73],"own":[74],"page":[77],"requests,":[78],"much":[81],"more":[82],"resistant.":[83],"In":[84],"are":[88],"request":[91],"sequences":[92,130],"R1,":[93],"R2,":[94],".":[95,96,97],",":[98,100],"Rp":[99],"which":[103],"accesses":[104],"disjoint":[106],"set":[107],"ask":[112],"question:":[114],"algorithm":[119,148],"optimize":[124],"completion":[126],"time":[127],"all":[129],"(i.e.,":[131],"makespan).":[133],"As":[134],"problem,":[139],"goal":[141],"design":[144],"an":[145,151],"online":[146],"achieves":[150],"optimal":[152],"competitive":[153],"ratio,":[154],"using":[155],"O(1)":[156],"resource":[157],"augmentation.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2025-10-10T00:00:00"}