{"id":"https://openalex.org/W2534170198","doi":"https://doi.org/10.1109/micro.2016.7783704","title":"Dictionary sharing: An efficient cache compression scheme for compressed caches","display_name":"Dictionary sharing: An efficient cache compression scheme for compressed caches","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2534170198","doi":"https://doi.org/10.1109/micro.2016.7783704","mag":"2534170198"},"language":"en","primary_location":{"id":"doi:10.1109/micro.2016.7783704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2016.7783704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)","raw_type":"proceedings-article"},"type":"preprint","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/A5101503372","display_name":"Biswabandan Panda","orcid":"https://orcid.org/0000-0001-5971-9456"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Biswabandan Panda","raw_affiliation_strings":["INRIA Campus de Beaulieu, Rennes, France"],"affiliations":[{"raw_affiliation_string":"INRIA Campus de Beaulieu, Rennes, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075222745","display_name":"Andr\u00e9 Seznec","orcid":"https://orcid.org/0000-0002-3058-6503"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Andre Seznec","raw_affiliation_strings":["INRIA Campus de Beaulieu, Rennes, France"],"affiliations":[{"raw_affiliation_string":"INRIA Campus de Beaulieu, Rennes, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101503372"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":4.1772,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94366716,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9984999895095825,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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.8758009672164917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8627917766571045},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.7700550556182861},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.7237537503242493},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.6840047836303711},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6712893843650818},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.6693515181541443},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.6563584804534912},{"id":"https://openalex.org/keywords/page-cache","display_name":"Page cache","score":0.6140846014022827},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.4683508276939392},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3966093957424164}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8758009672164917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8627917766571045},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.7700550556182861},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.7237537503242493},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.6840047836303711},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6712893843650818},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.6693515181541443},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.6563584804534912},{"id":"https://openalex.org/C36340418","wikidata":"https://www.wikidata.org/wiki/Q7124288","display_name":"Page cache","level":5,"score":0.6140846014022827},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.4683508276939392},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3966093957424164}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/micro.2016.7783704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2016.7783704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9100000262260437}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1955235267","https://openalex.org/W1963881655","https://openalex.org/W1976494130","https://openalex.org/W1976919080","https://openalex.org/W1978085294","https://openalex.org/W1983305800","https://openalex.org/W2013395246","https://openalex.org/W2019401312","https://openalex.org/W2029577083","https://openalex.org/W2093819294","https://openalex.org/W2101756288","https://openalex.org/W2103397328","https://openalex.org/W2109562980","https://openalex.org/W2112197601","https://openalex.org/W2114668191","https://openalex.org/W2130252115","https://openalex.org/W2143835304","https://openalex.org/W2147657366","https://openalex.org/W2147657598","https://openalex.org/W2155366133","https://openalex.org/W2160996172","https://openalex.org/W2162752393","https://openalex.org/W2166620913","https://openalex.org/W2236479978","https://openalex.org/W2521480511","https://openalex.org/W3142886131","https://openalex.org/W4234059337","https://openalex.org/W4238816702","https://openalex.org/W4249176607","https://openalex.org/W6676697279"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2535115842","https://openalex.org/W2546991807","https://openalex.org/W2734782074","https://openalex.org/W2020176098","https://openalex.org/W2076114130","https://openalex.org/W2116323004","https://openalex.org/W2121191383","https://openalex.org/W1584415117","https://openalex.org/W4252570104"],"abstract_inverted_index":{"The":[0,89,180],"effectiveness":[1],"of":[2,23,102,166,184,201,221],"a":[3,75,85,122,134,145,154,158,167,188],"compressed":[4,25,28,34,41,58,82,202],"cache":[5,21,29,35,42,59,71,104,112,125,135,155,168,178,199,205],"depends":[6],"on":[7],"three":[8],"features:":[9],"i)":[10],"the":[11,15,20,24,99,103,142,149,162,171,198,211],"compression":[12,66,100,126,212,222],"scheme,":[13,17],"ii)":[14],"compaction":[16,76,97,150],"and":[18,31,48,63,73,106,170,193,217,234],"iii)":[19],"layout":[22,200],"cache.":[26],"Skewed":[27],"(SCC)":[30],"yet":[32],"another":[33],"(YACC)":[36],"are":[37],"two":[38],"recently":[39],"proposed":[40],"layouts":[43,206],"that":[44,128,141,160,207],"feature":[45],"minimal":[46],"storage":[47],"latency":[49,192],"overheads,":[50],"while":[51],"achieving":[52],"comparable":[53],"performance":[54,229],"over":[55],"more":[56],"complex":[57],"layouts.":[60],"Both":[61],"SCC":[62],"YACC":[64],"use":[65,208],"techniques":[67,95],"to":[68,78,226,232,239],"compress":[69],"individual":[70],"blocks,":[72,105],"then":[74],"technique":[77],"compact":[79],"multiple":[80,176],"contiguous":[81],"blocks":[83],"into":[84],"single":[86,189],"data":[87],"entry.":[88],"primary":[90],"attribute":[91],"used":[92],"by":[93,137],"these":[94],"for":[96,148],"is":[98,144,173],"factor":[101],"in":[107,139,219],"this":[108,115,130],"process,":[109],"they":[110],"waste":[111],"space.":[113],"In":[114],"paper,":[116],"we":[117],"propose":[118],"dictionary":[119,123,159,172],"sharing":[120],"(DISH),":[121],"based":[124],"scheme":[127,183],"reduces":[129],"wastage.":[131],"DISH":[132,152,185,209],"compresses":[133],"block":[136,143,156,169],"keeping":[138],"mind":[140],"potential":[146],"candidate":[147],"process.":[151],"encodes":[153],"with":[157],"stores":[161],"distinct":[163],"4-byte":[164],"chunks":[165],"shared":[174],"among":[175],"neighboring":[177],"blocks.":[179],"simple":[181],"encoding":[182],"also":[186],"provides":[187],"cycle":[190],"decompression":[191],"it":[194],"does":[195],"not":[196],"change":[197],"caches.":[203],"Compressed":[204],"outperforms":[210],"schemes,":[213],"such":[214],"as":[215],"BDI":[216],"CPACK+Z,":[218],"terms":[220],"ratio":[223],"(from":[224,230,237],"1.7X":[225],"2.3X),":[227],"system":[228],"7.2%":[231],"14.3%),":[233],"energy":[235],"efficiency":[236],"6%":[238],"16%).":[240]},"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":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4}],"updated_date":"2026-03-06T13:50:29.536080","created_date":"2025-10-10T00:00:00"}