{"id":"https://openalex.org/W1976590329","doi":"https://doi.org/10.1109/pccc.2013.6742754","title":"Proposed enhancements to fixed segmented LRU cache replacement policy","display_name":"Proposed enhancements to fixed segmented LRU cache replacement policy","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1976590329","doi":"https://doi.org/10.1109/pccc.2013.6742754","mag":"1976590329"},"language":"en","primary_location":{"id":"doi:10.1109/pccc.2013.6742754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2013.6742754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5030462078","display_name":"Kathlene Hurt","orcid":null},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kathlene Hurt","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, United States","Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, United States","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX, USA#TAB#","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027851216","display_name":"Byeong Kil Lee","orcid":"https://orcid.org/0000-0002-0260-2238"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Byeong Kil Lee","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, United States","Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, United States","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX, USA#TAB#","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":null,"apc_paid":null,"fwci":0.2683,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4027891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9731000065803528,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7849358320236206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7788913249969482},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.6928502321243286},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.592463493347168},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.49919986724853516},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.43596789240837097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3574496805667877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08000913262367249}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7849358320236206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7788913249969482},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6928502321243286},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.592463493347168},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.49919986724853516},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.43596789240837097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3574496805667877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08000913262367249},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pccc.2013.6742754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2013.6742754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2083949414","https://openalex.org/W3158149042","https://openalex.org/W6794215233"],"related_works":["https://openalex.org/W2147122795","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2268996566","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W2012518269","https://openalex.org/W2068309140","https://openalex.org/W4239937081"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,41,98,111,130],"this":[3,61],"research":[4],"is":[5],"to":[6,18,28,47,55,77],"design":[7],"a":[8,107,126],"low":[9],"cost":[10],"cache":[11,80],"replacement":[12],"algorithm":[13,33],"that":[14,37,90],"achieves":[15],"comparable":[16],"performance":[17],"existing":[19],"scheme.":[20],"In":[21,60],"previous":[22],"work,":[23,62],"we":[24,52,63,124],"proposed":[25],"an":[26,48,69,94],"enhancement":[27],"the":[29,39,78],"SLRU":[30,36,67,92],"(Segmented":[31],"LRU)":[32],"called":[34],"fixed":[35,66,91],"fixes":[38],"number":[40],"protected":[42],"and":[43,73,84,102,115],"probationary":[44],"segments.":[45],"Due":[46],"ineffective":[49],"simulation":[50,71],"environment,":[51,72],"were":[53],"unable":[54],"fully":[56],"understand":[57],"our":[58],"results.":[59],"will":[64],"test":[65],"with":[68,106],"improved":[70],"propose":[74],"three":[75],"enhancements":[76,122],"algorithm:":[79],"bypassing,":[81],"random":[82],"promotion,":[83],"aging.":[85],"Our":[86],"experiment":[87],"results":[88],"show":[89],"achieved":[93,125],"average":[95],"speed":[96,109,128],"up":[97,110,129],"7.00%":[99],"over":[100,104,113,117,132],"LRU,":[101,114],"4.22%":[103],"SLRU,":[105],"maximum":[108,127],"43.55%":[112],"41.59%":[116],"standard":[118],"SLRU.":[119],"With":[120],"certain":[121],"applied,":[123],"61.70%":[131],"LRU.":[133]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}