{"id":"https://openalex.org/W133196353","doi":null,"title":"On multi-level exclusive caching: offline optimality and why promotions are better than demotions","display_name":"On multi-level exclusive caching: offline optimality and why promotions are better than demotions","alternate_titles":[],"publication_year":2008,"publication_date":"2008-02-26","ids":{"openalex":"https://openalex.org/W133196353","mag":"133196353"},"language":"en","primary_location":{"id":"mag:133196353","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/fast/fast2008.html#Gill08","pdf_url":null,"source":{"id":"https://openalex.org/S4306418422","display_name":"File and Storage Technologies","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"File and Storage Technologies","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W133196353"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5067794111","display_name":"Binny S. Gill","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Binny S. Gill","raw_affiliation_strings":["IBM Almaden Research Center,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center,#TAB#","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067794111"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":3.2941,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.93220339,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5785999894142151,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5785999894142151,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.3061999976634979,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.016100000590085983,"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/multi-level-cache-hierarchy","display_name":"multi-level cache hierarchy","score":0.9710000157356262},{"id":"https://openalex.org/keywords/cache-management-policies","display_name":"cache management policies","score":0.8140000104904175},{"id":"https://openalex.org/keywords/response-time","display_name":"response time","score":0.7210000157356262},{"id":"https://openalex.org/keywords/lru-cache","display_name":"LRU cache","score":0.5460000038146973},{"id":"https://openalex.org/keywords/data-redundancy","display_name":"data redundancy","score":0.49399998784065247}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8650615215301514},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8434966802597046},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6977760791778564},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.6043435335159302},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.5206007957458496},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4953426420688629},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4593084752559662},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.45791780948638916},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4225456118583679},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40750449895858765},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23383942246437073},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:133196353","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/fast/fast2008.html#Gill08","pdf_url":null,"source":{"id":"https://openalex.org/S4306418422","display_name":"File and Storage Technologies","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"File and Storage Technologies","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.8599","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.8599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.usenix.org/event/fast08/tech/full_papers/gill/gill.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W56189128","https://openalex.org/W67693709","https://openalex.org/W157160120","https://openalex.org/W1537068154","https://openalex.org/W1578858535","https://openalex.org/W1632732363","https://openalex.org/W1844039966","https://openalex.org/W1860107648","https://openalex.org/W1974817122","https://openalex.org/W1987225815","https://openalex.org/W2012669892","https://openalex.org/W2054997699","https://openalex.org/W2058884229","https://openalex.org/W2072853307","https://openalex.org/W2079656678","https://openalex.org/W2080232995","https://openalex.org/W2095562348","https://openalex.org/W2096013455","https://openalex.org/W2102689840","https://openalex.org/W2110658741","https://openalex.org/W2111784404","https://openalex.org/W2112053513","https://openalex.org/W2116487403","https://openalex.org/W2121605376","https://openalex.org/W2131806537","https://openalex.org/W2134385063","https://openalex.org/W2138543759","https://openalex.org/W2142098074","https://openalex.org/W2144570882","https://openalex.org/W2146296339","https://openalex.org/W2158310845","https://openalex.org/W2169729486","https://openalex.org/W2170950955","https://openalex.org/W3150149233"],"related_works":["https://openalex.org/W7095238589","https://openalex.org/W2012669892","https://openalex.org/W7098039352","https://openalex.org/W2757753237","https://openalex.org/W2053540114","https://openalex.org/W2347751226","https://openalex.org/W2904007994","https://openalex.org/W2007964325","https://openalex.org/W2158310845"],"abstract_inverted_index":{"Why":[0],"promotions":[1],"are":[2,44],"better":[3,77,142],"than":[4],"demotions.":[5],"Abstract":[6],"\u2014":[7],"Multi-level":[8],"cache":[9,17,42,88,138,201,211,237,251],"hierarchies":[10,43,89],"have":[11],"become":[12],"very":[13],"common;":[14],"however,":[15],"most":[16],"management":[18],"policies":[19],"result":[20],"in":[21,40,70,86,98,135,159,164,282],"duplicating":[22],"the":[23,45,95,118,126,136,231,283],"same":[24,127],"data":[25],"redundantly":[26],"on":[27,185,198,230,244],"multiple":[28],"levels.":[29],"The":[30],"state-of-the-art":[31],"exclusive":[32,84],"caching":[33,85],"techniques":[34],"used":[35],"to":[36,107,111,114,117,141,181,196],"mitigate":[37],"this":[38],"wastage":[39],"multi-level":[41,210,236,286],"DEMOTE":[46,122,153,184],"technique":[47,106],"and":[48,62,123,192,220,227,250,254,267,278],"its":[49],"variants.":[50],"While":[51,120],"these":[52],"achieve":[53],"good":[54],"hit":[55,129],"ratios,":[56,130],"they":[57],"suffer":[58],"from":[59,167],"significant":[60],"I/O":[61],"computational":[63],"overheads,":[64],"making":[65],"them":[66],"unsuitable":[67],"for":[68,183,208,265],"deployment":[69],"real-life":[71,169],"systems.":[72],"We":[73,203,213],"propose":[74],"a":[75,165,168,186,199,240,245],"dramatically":[76],"performing":[78],"alternative":[79],"called":[80,218],"PROMOTE,":[81],"which":[82,109],"provides":[83],"multilevel":[87],"without":[90],"demotions":[91],"or":[92],"any":[93],"of":[94,177,189,235,242,248,262,285],"overheads":[96],"inherent":[97],"DEMOTE.":[99],"PROMOTE":[100,124,131,150,171],"uses":[101],"an":[102,173],"adaptive":[103],"probabilistic":[104],"filtering":[105],"decide":[108],"pages":[110],"\u201cpromote":[112],"\u201d":[113],"caches":[115],"closer":[116],"application.":[119],"both":[121],"provide":[125],"aggregate":[128],"achieves":[132],"more":[133,157],"hits":[134],"highest":[137],"levels":[139],"leading":[140],"response":[143,175],"times.":[144],"When":[145],"inter-cache":[146],"bandwidth":[147,160],"is":[148],"limited,":[149],"convincingly":[151],"outperforms":[152],"by":[154],"being":[155],"2x":[156],"efficient":[158],"usage.":[161],"For":[162,239],"example,":[163],"trace":[166],"scenario,":[170],"provided":[172],"average":[174],"time":[176],"3.42ms":[178],"as":[179,194,225],"compared":[180,195],"5.05ms":[182],"two-level":[187],"hierarchy":[188],"LRU":[190],"caches,":[191],"5.93ms":[193],"7.57ms":[197],"three-level":[200],"hierarchy.":[202],"also":[204],"discover":[205],"theoretical":[206],"bounds":[207,229,273],"optimal":[209,233],"performance.":[212],"devise":[214],"two":[215],"offline":[216],"policies,":[217],"OPT-UB":[219,253],"OPT-LB,":[221],"that":[222],"provably":[223],"serve":[224],"upper":[226],"lower":[228],"theoretically":[232],"performance":[234],"hierarchies.":[238],"series":[241],"experiments":[243],"wide":[246],"gamut":[247],"traces":[249],"sizes":[252],"OPT-LB":[255],"ran":[256],"within":[257],"2.18":[258],"%":[259,261],"and2.83":[260],"each":[263],"other":[264],"two-cache":[266],"three-cache":[268],"hierarchies,":[269],"respectively.":[270],"These":[271],"close":[272],"will":[274],"help":[275],"evaluate":[276],"algorithms":[277],"guide":[279],"future":[280],"improvements":[281],"field":[284],"caching.":[287],"I.":[288]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W133196353","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
