{"id":"https://openalex.org/W21556383","doi":null,"title":"Investigation of generalized caching","display_name":"Investigation of generalized caching","alternate_titles":[],"publication_year":1998,"publication_date":"1998-03-17","ids":{"openalex":"https://openalex.org/W21556383","mag":"21556383"},"language":"en","primary_location":{"id":"mag:21556383","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=287133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W21556383"],"child_works_count":0,"type":"article","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/A5026984207","display_name":"Saied Hosseini-Khayat","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Saied Hosseini-Khayat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5026984207"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1504,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.73563218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":92},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.8398000001907349,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8398000001907349,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.10159999877214432,"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/T11269","display_name":"Algorithms and Data Compression","score":0.03610000014305115,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9020000100135803},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8090000152587891},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7149999737739563},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.6309999823570251},{"id":"https://openalex.org/keywords/locality-of-reference","display_name":"locality of reference","score":0.8270000219345093},{"id":"https://openalex.org/keywords/request-sequences","display_name":"request sequences","score":0.5450000166893005}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.8097668290138245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.718683660030365},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.686083197593689},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6410869359970093},{"id":"https://openalex.org/C133588205","wikidata":"https://www.wikidata.org/wiki/Q28455645","display_name":"Instruction prefetch","level":3,"score":0.5809414386749268},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5343489050865173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5046952962875366},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.48979973793029785},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4897613525390625},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.464307576417923},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42638060450553894},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3559410274028778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35574257373809814},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.32962435483932495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23284104466438293},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16033408045768738},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:21556383","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=287133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1586420398","https://openalex.org/W1422019770","https://openalex.org/W1421917539","https://openalex.org/W2809563571","https://openalex.org/W2161955331","https://openalex.org/W3010407258","https://openalex.org/W2900830292","https://openalex.org/W1543625417","https://openalex.org/W2154428591","https://openalex.org/W2081534862"],"abstract_inverted_index":{"This":[0],"dissertation":[1,107],"studies":[2],"the":[3,18,27,45,49,52,65,78,104,109,113,131,152,168,261,266],"replacement":[4],"problem":[5,28,114,134],"that":[6,17,35,99,121,150,219],"arises":[7],"in":[8,57,96,163,179,233],"caching":[9,92,101,133],"data":[10],"objects":[11],"of":[12,48,63,81,112,139,170,186,196,252,263,268],"non-uniform":[13],"size.":[14],"It":[15,25,88,254],"assumes":[16],"cache":[19,58,174],"miss":[20],"penalties":[21],"are":[22,68,124,160,184,207],"also":[23,73,161,255],"non-uniform.":[24],"formulates":[26],"as":[29,115],"a":[30,93,128,136,140,193,200,230,238,244,248,257],"discrete":[31],"optimization":[32],"problem,":[33],"proves":[34,218],"it":[36,119,145,178,217,236],"is":[37,55,192,199,226],"NP-complete,":[38],"and":[39,70,176,188,247,265],"proposes":[40],"an":[41,75,147],"optimal":[42,66,85,148],"solution":[43,54,67],"for":[44,173,250],"off-line":[46,61],"variant":[47,111],"problem.":[50],"Since":[51],"proposed":[53,69,205],"exponential":[56],"size,":[59],"two":[60],"methods":[62],"approximating":[64],"explored.":[71],"We":[72,166],"find":[74],"upper-bound":[76],"on":[77,240],"worst-case":[79],"cost":[80,155,172],"scLFD":[82],"(the":[83],"classical":[84,94,231],"paging":[86,97,269],"algorithm).":[87],"extends":[89],"to":[90,127,223],"generalized":[91,132,224],"theorem":[95],"stating":[98],"prefetch":[100],"cannot":[102],"reduce":[103],"total":[105,154],"cost.\r\nThis":[106],"explores":[108],"on-line":[110,202],"well.":[116],"In":[117],"particular,":[118],"shows":[120],"if":[122],"requests":[123],"issued":[125],"according":[126],"Markov":[129,141],"chain,":[130],"becomes":[135],"special":[137],"case":[138],"decision":[142],"process.":[143],"Then":[144],"outlines":[146],"algorithm":[149],"minimizes":[151],"expected":[153],"over":[156],"infinite":[157],"horizon.\r\nHeuristic":[158],"algorithms":[159],"explored":[162],"this":[164],"dissertation.":[165],"introduce":[167],"concept":[169],"specific":[171],"objects,":[175],"use":[177],"three":[180],"different":[181],"heuristics.":[182],"Two":[183],"variants":[185],"scLRU":[187],"scLFD.":[189],"The":[190],"third":[191],"minor":[194],"modification":[195],"scHARMONIC,":[197],"which":[198],"randomized":[201],"algorithm.":[203],"All":[204],"heuristics":[206],"compared":[208],"with":[209],"competing":[210],"algorithms,":[211],"using":[212],"actual":[213],"Web":[214],"traces.":[215],"Also":[216],"scLRU,":[220],"when":[221],"applied":[222],"caching,":[225],"competitive,":[227],"partly":[228],"extending":[229],"result":[232],"memory":[234],"paging.\r\nFinally,":[235],"presents":[237],"discussion":[239],"request":[241],"sequences,":[242],"introducing":[243],"characteristic":[245],"function":[246],"measure":[249],"locality":[251],"reference.":[253],"reveals":[256],"fundamental":[258],"connection":[259],"between":[260],"structure":[262],"sequences":[264],"performance":[267],"algorithms.":[270]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W21556383","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}
