{"id":"https://openalex.org/W2019131264","doi":"https://doi.org/10.1145/2755573.2755585","title":"Online Caching with Convex Costs","display_name":"Online Caching with Convex Costs","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2019131264","doi":"https://doi.org/10.1145/2755573.2755585","mag":"2019131264"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5032872922","display_name":"Ishai Menache","orcid":"https://orcid.org/0000-0002-2540-236X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ishai Menache","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohit Singh","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032872922"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.6656,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.73903697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"54"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9976000189781189,"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.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8012073040008545},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6196263432502747},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5761290788650513},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.564512312412262},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5214169025421143},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4944725036621094},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4766177237033844},{"id":"https://openalex.org/keywords/access-time","display_name":"Access time","score":0.4569835960865021},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45648571848869324},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43826884031295776},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4090133011341095},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39453327655792236},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2171349823474884},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21588915586471558},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18757450580596924},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11109304428100586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08740249276161194}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8012073040008545},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6196263432502747},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5761290788650513},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.564512312412262},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5214169025421143},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4944725036621094},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4766177237033844},{"id":"https://openalex.org/C194080101","wikidata":"https://www.wikidata.org/wiki/Q46306","display_name":"Access time","level":2,"score":0.4569835960865021},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45648571848869324},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43826884031295776},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4090133011341095},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39453327655792236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2171349823474884},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21588915586471558},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18757450580596924},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11109304428100586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08740249276161194},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2755585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W200016408","https://openalex.org/W1527643973","https://openalex.org/W1552828154","https://openalex.org/W1734799737","https://openalex.org/W1987225815","https://openalex.org/W1989725425","https://openalex.org/W2033156334","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2054308357","https://openalex.org/W2078199441","https://openalex.org/W2142339200","https://openalex.org/W2184900279","https://openalex.org/W2217174568","https://openalex.org/W2253769547","https://openalex.org/W2294869799","https://openalex.org/W2296319761","https://openalex.org/W2999097477","https://openalex.org/W4206478994","https://openalex.org/W4241687679"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"Modern":[0],"software":[1],"applications":[2],"and":[3,12,20,58,152,176],"services":[4,24],"operate":[5],"nowadays":[6],"on":[7,159,186],"top":[8],"of":[9,60,96,103,107,113,162,189,200],"large":[10],"clusters":[11],"datacenters.":[13],"To":[14],"reduce":[15],"the":[16,26,36,55,91,104,148,160,163,174,177,187,197],"underlying":[17],"infrastructure":[18],"cost":[19,123,164],"increase":[21],"utilization,":[22],"different":[23,56],"share":[25,76],"same":[27],"physical":[28],"resources":[29,48],"(e.g.,":[30],"CPU,":[31],"bandwidth,":[32],"I/O,":[33],"memory).":[34],"Consequently,":[35],"cluster":[37],"provider":[38],"often":[39],"has":[40],"to":[41,46,75],"decide":[42],"in":[43,49,86],"real-time":[44],"how":[45,74],"allocate":[47],"overbooked":[50],"systems,":[51],"taking":[52],"into":[53],"account":[54],"characteristics":[57],"requirements":[59],"users.":[61],"In":[62,138],"this":[63,71],"paper,":[64],"we":[65,181],"consider":[66],"an":[67,117],"important":[68],"problem":[69],"within":[70],"space":[72],"--":[73],"memory":[77,81,149,178],"between":[78],"users,":[79],"whose":[80],"access":[82],"patterns":[83],"are":[84],"unknown":[85],"advance.":[87],"We":[88,115,125,166],"assume":[89],"that":[90],"overall":[92],"performance":[93,175,188],"(or":[94],"cost)":[95],"each":[97],"user":[98],"is":[99,142,147,154],"a":[100,110,155,169,183],"non-linear":[101],"function":[102],"total":[105],"number":[106],"misses":[108],"over":[109],"given":[111],"period":[112],"time.":[114],"develop":[116],"online":[118,191],"caching":[119],"algorithm":[120,141,193],"for":[121,130],"arbitrary":[122],"functions.":[124,165],"further":[126],"provide":[127],"theoretical":[128],"guarantees":[129],"convex":[131],"functions":[132],"(which":[133],"capture":[134],"plausible":[135],"practical":[136],"scenarios).":[137],"particular,":[139],"our":[140,201],"\u03b1\u03b1":[143],"k\u03b1-competitive,":[144],"where":[145],"k":[146],"(cache)":[150],"size,":[151],"\u03b1":[153],"constant":[156],"which":[157,172,194],"depends":[158],"curvature":[161],"also":[167],"obtain":[168],"bi-criteria":[170],"result":[171],"trades-off":[173],"size.":[179],"Finally,":[180],"give":[182],"lower":[184],"bound":[185,199],"any":[190],"deterministic":[192],"nearly":[195],"matches":[196],"upper":[198],"algorithm.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}