{"id":"https://openalex.org/W1972703906","doi":"https://doi.org/10.1145/1054943.1054945","title":"A compressed memory hierarchy using an indirect index cache","display_name":"A compressed memory hierarchy using an indirect index cache","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1972703906","doi":"https://doi.org/10.1145/1054943.1054945","mag":"1972703906"},"language":"en","primary_location":{"id":"doi:10.1145/1054943.1054945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1054943.1054945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd workshop on Memory performance issues in conjunction with the 31st international symposium on computer architecture - WMPI '04","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/A5031851647","display_name":"Erik G. Hallnor","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik G. Hallnor","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI","University of Michigan,Ann Arbor,MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan,Ann Arbor,MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109010789","display_name":"Steven K. Reinhardt","orcid":"https://orcid.org/0000-0002-2479-0030"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven K. Reinhardt","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI","University of Michigan,Ann Arbor,MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan,Ann Arbor,MI","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1801,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9098681,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"15"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9991000294685364,"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/computer-science","display_name":"Computer science","score":0.7214575409889221},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.6451369524002075},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6051664352416992},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.561553418636322},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5003130435943604},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4763791263103485},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11766192317008972}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7214575409889221},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.6451369524002075},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6051664352416992},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.561553418636322},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5003130435943604},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4763791263103485},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11766192317008972},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1054943.1054945","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1054943.1054945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd workshop on Memory performance issues in conjunction with the 31st international symposium on computer architecture - WMPI '04","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.7782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.7782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utah.edu/wmpi2004/papers/paper-140.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.9419","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.9419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~stever/pubs/wmpi04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.9612","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.9612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/techreports/cse/2004/CSE-TR-488-04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1487249727","https://openalex.org/W1584744778","https://openalex.org/W1976494130","https://openalex.org/W2029307214","https://openalex.org/W2033062187","https://openalex.org/W2108117840","https://openalex.org/W2120459733","https://openalex.org/W2122675611","https://openalex.org/W2123488428","https://openalex.org/W2132153846","https://openalex.org/W2148356835","https://openalex.org/W2153456949","https://openalex.org/W2154614859","https://openalex.org/W2159410636","https://openalex.org/W2161088908","https://openalex.org/W2212488422"],"related_works":["https://openalex.org/W2489934651","https://openalex.org/W108401543","https://openalex.org/W2279642117","https://openalex.org/W4300190729","https://openalex.org/W2953056293","https://openalex.org/W2035037799","https://openalex.org/W1971123707","https://openalex.org/W4200143910","https://openalex.org/W2019374455","https://openalex.org/W2033486618"],"abstract_inverted_index":{"The":[0],"large":[1],"and":[2,24,38,46,68],"growing":[3],"impact":[4],"of":[5,35,42,106,202],"memory":[6,27,36,58,141,215],"hierarchies":[7],"on":[8,112,171,189],"overall":[9],"system":[10],"performance":[11,148,166,176],"compels":[12],"designers":[13],"to":[14,18,92,102,108,169,200],"investigate":[15],"innovative":[16],"techniques":[17],"improve":[19],"memory-system":[20],"efficiency.":[21],"We":[22,95],"propose":[23],"analyze":[25],"a":[26,53,86,97,121,135,186,190],"hierarchy":[28],"that":[29,162],"increases":[30,165],"both":[31],"the":[32,39,82,139,157,206],"effective":[33,40,72,140,211],"capacity":[34],"structures":[37,133],"bandwidth":[41,151],"interconnects":[43],"by":[44,65,77,85,167,179],"storing":[45,78],"transmitting":[47],"data":[48,130],"in":[49,56,134,177],"compressed":[50,79,87,117,123,136],"form.Caches":[51],"play":[52],"key":[54],"role":[55],"hiding":[57],"latencies.":[59],"However,":[60],"cache":[61,118,212],"sizes":[62],"are":[63],"constrained":[64],"die":[66],"area":[67],"cost.":[69],"A":[70],"cache's":[71],"size":[73],"can":[74,89,127],"be":[75,90],"increased":[76,210],"data,":[80],"if":[81],"storage":[83,107],"unused":[84],"block":[88],"allocated":[91],"other":[93,184],"blocks.":[94],"use":[96],"modified":[98],"Indirect":[99],"Index":[100],"Cache":[101],"allocate":[103],"variable":[104],"amounts":[105],"different":[109],"blocks,":[110],"depending":[111],"their":[113],"compressibility.By":[114],"coupling":[115],"our":[116,163,218],"design":[119,164,219],"with":[120,205],"similarly":[122],"main":[124],"memory,":[125],"we":[126],"easily":[128],"transfer":[129],"between":[131],"these":[132],"state,":[137],"increasing":[138],"bus":[142,150,194],"bandwidth.":[143],"This":[144],"optimization":[145],"further":[146],"improves":[147],"when":[149],"is":[152],"critical.Our":[153],"simulation":[154],"results,":[155],"using":[156],"SPEC":[158],"CPU2000":[159],"benchmarks,":[160],"show":[161],"up":[168,199],"225%":[170],"some":[172],"benchmarks":[173],"while":[174],"degrading":[175],"general":[178],"no":[180],"more":[181,222],"than":[182,185],"2%,":[183],"12%":[187],"decrease":[188],"single":[191],"benchmark.":[192],"Compressed":[193],"transfers":[195],"alone":[196],"account":[197],"for":[198],"80%":[201],"this":[203],"improvement,":[204],"remainder":[207],"coming":[208],"from":[209],"capacity.":[213],"As":[214],"latencies":[216],"increase,":[217],"becomes":[220],"even":[221],"beneficial.":[223]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}