{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:46:35Z","timestamp":1772725595693,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2016-04265, NETGP 485577-15"],"award-info":[{"award-number":["RGPIN-2016-04265, NETGP 485577-15"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,9]]},"DOI":"10.1145\/3373376.3378518","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T22:37:01Z","timestamp":1584139021000},"page":"527-540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Thesaurus"],"prefix":"10.1145","author":[{"given":"Amin","family":"Ghasemazar","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Prashant","family":"Nair","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Mieszko","family":"Lis","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2020,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Database-friendly Random Projections. In PODS","author":"Achlioptas D.","year":"2001","unstructured":"D. Achlioptas . 2001 . Database-friendly Random Projections. In PODS 2001. D. Achlioptas. 2001. Database-friendly Random Projections. In PODS 2001."},{"key":"e_1_3_2_1_2_1","unstructured":"A. Alameldeen and D. Wood. 2004. Frequent pattern compression: A significance-based compression scheme for L2 caches. Technical Report. University of Wisconsin-Madison Department of Computer Sciences.  A. Alameldeen and D. Wood. 2004. Frequent pattern compression: A significance-based compression scheme for L2 caches. Technical Report. University of Wisconsin-Madison Department of Computer Sciences."},{"key":"e_1_3_2_1_3_1","volume-title":"ISCA","author":"Alameldeen A. R.","year":"2004","unstructured":"A. R. Alameldeen and D. A. Wood . 2004. Adaptive cache compression for high-performance processors . In ISCA 2004 . A. R. Alameldeen and D. A. Wood. 2004. Adaptive cache compression for high-performance processors. In ISCA 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"MICRO","author":"Arelakis A.","year":"2015","unstructured":"A. Arelakis , F. Dahlgren , and P. Stenstr\u00a8om . 2015. HyComp: A hybrid cache compression method for selection of data-type-specific compression methods . In MICRO 2015 . 38--49. A. Arelakis, F. Dahlgren, and P. Stenstr\u00a8om. 2015. HyComp: A hybrid cache compression method for selection of data-type-specific compression methods. In MICRO 2015. 38--49."},{"key":"e_1_3_2_1_5_1","volume-title":"ISCA","author":"Arelakis Angelos","year":"2014","unstructured":"Angelos Arelakis and Per Stenstr\u00a8om . 2014 . SC2: A Statistical Compression Cache Scheme . In ISCA 2014. Angelos Arelakis and Per Stenstr\u00a8om. 2014. SC2: A Statistical Compression Cache Scheme. In ISCA 2014."},{"key":"e_1_3_2_1_6_1","volume-title":"HPCA","author":"Baek S.","year":"2013","unstructured":"S. Baek , H. G. Lee , C. Nicopoulos , J. Lee , and J. Kim . 2013. ECM: Effective Capacity Maximizer for high-performance compressed caching . In HPCA 2013 . S. Baek, H. G. Lee, C. Nicopoulos, J. Lee, and J. Kim. 2013. ECM: Effective Capacity Maximizer for high-performance compressed caching. In HPCA 2013."},{"key":"e_1_3_2_1_7_1","volume-title":"SPEC CPU2017 - Next-generation Compute Benchmark. In ICPE","author":"Bucek J.","year":"2018","unstructured":"J. Bucek , K.-D. Lange , and J. von Kistowski . 2018 . SPEC CPU2017 - Next-generation Compute Benchmark. In ICPE 2018. J. Bucek, K.-D. Lange, and J. von Kistowski. 2018. SPEC CPU2017 - Next-generation Compute Benchmark. In ICPE 2018."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.5.419"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2020989"},{"key":"e_1_3_2_1_11_1","volume-title":"HICAMP: Architectural Support for Efficient Concurrencysafe Shared Structured Data Access. In ASPLOS","author":"Cheriton D.","year":"2012","unstructured":"D. Cheriton , A. Firoozshahian , A. Solomatnikov , J. P. Stevenson , and O. Azizi . 2012 . HICAMP: Architectural Support for Efficient Concurrencysafe Shared Structured Data Access. In ASPLOS 2012 . D. Cheriton, A. Firoozshahian, A. Solomatnikov, J. P. Stevenson, and O. Azizi. 2012. HICAMP: Architectural Support for Efficient Concurrencysafe Shared Structured Data Access. In ASPLOS 2012."},{"key":"e_1_3_2_1_12_1","volume-title":"BMVC","author":"Chum O.","year":"2008","unstructured":"O. Chum , J. Philbin , and A. Zisserman . 2008. Near Duplicate Image Detection: min-Hash and tf-idf Weighting . In BMVC 2008 . O. Chum, J. Philbin, and A. Zisserman. 2008. Near Duplicate Image Detection: min-Hash and tf-idf Weighting. In BMVC 2008."},{"key":"e_1_3_2_1_13_1","unstructured":"T. E. Denehy andW.W. Hsu. 2003. Duplicate management for reference data. In Research Report RJ10305 IBM.  T. E. Denehy andW.W. Hsu. 2003. Duplicate management for reference data. In Research Report RJ10305 IBM."},{"key":"e_1_3_2_1_14_1","volume-title":"Zero-content Augmented Caches. In ICS","author":"Dusser J.","year":"2009","unstructured":"J. Dusser , T. Piquet , and A. Seznec . 2009 . Zero-content Augmented Caches. In ICS 2009 . J. Dusser, T. Piquet, and A. Seznec. 2009. Zero-content Augmented Caches. In ICS 2009."},{"key":"e_1_3_2_1_15_1","volume-title":"ISCA","author":"Ekman M.","year":"2005","unstructured":"M. Ekman and P. Stenstr\u00a8om . 2005. A Robust Main-Memory Compression Scheme . In ISCA 2005 . M. Ekman and P. Stenstr\u00a8om. 2005. A Robust Main-Memory Compression Scheme. In ISCA 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741667"},{"key":"e_1_3_2_1_17_1","volume-title":"KDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . 1996. A density-based algorithm for discovering clusters in large spatial databases with noise . In KDD 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD 1996."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2016.7929193"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/48184.48193"},{"key":"e_1_3_2_1_20_1","volume-title":"Base-Victim Compression: An Opportunistic Cache Compression Architecture. In ISCA","author":"Gaur J.","year":"2016","unstructured":"J. Gaur , A. R. Alameldeen , and S. Subramoney . 2016 . Base-Victim Compression: An Opportunistic Cache Compression Architecture. In ISCA 2016 . J. Gaur, A. R. Alameldeen, and S. Subramoney. 2016. Base-Victim Compression: An Opportunistic Cache Compression Architecture. In ISCA 2016."},{"key":"e_1_3_2_1_21_1","volume-title":"DATE","author":"Ghasemazar A.","year":"2020","unstructured":"A. Ghasemazar , M. Ewais , P. Nair , and M. Lis . 2020. 2DCC: Cache Compression in Two Dimensions . In DATE 2020 . A. Ghasemazar, M. Ewais, P. Nair, and M. Lis. 2020. 2DCC: Cache Compression in Two Dimensions. In DATE 2020."},{"key":"e_1_3_2_1_22_1","volume-title":"Local Sensitive Hashing (LSH) and Convolutional Neural Networks (CNNs) for Object Recognition. In ICMLA","author":"Ghayoumi M.","year":"2018","unstructured":"M. Ghayoumi , M. Gomez , K. E. Baumstein , N. Persaud , and A. J. Perlowin . 2018 . Local Sensitive Hashing (LSH) and Convolutional Neural Networks (CNNs) for Object Recognition. In ICMLA 2018 . M. Ghayoumi, M. Gomez, K. E. Baumstein, N. Persaud, and A. J. Perlowin. 2018. Local Sensitive Hashing (LSH) and Convolutional Neural Networks (CNNs) for Object Recognition. In ICMLA 2018."},{"key":"e_1_3_2_1_23_1","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . 1999. Similarity Search in High Dimensions via Hashing . In VLDB 1999 . A. Gionis, P. Indyk, and R. Motwani. 1999. Similarity Search in High Dimensions via Hashing. In VLDB 1999."},{"key":"e_1_3_2_1_24_1","volume-title":"MSST","author":"Hong B.","year":"2004","unstructured":"B. Hong , D. Plantenberg , D. D. E. Long , and M. Sivan-Zimet . 2004. Duplicate Data Elimination in a SAN File System . In MSST 2004 . B. Hong, D. Plantenberg, D. D. E. Long, and M. Sivan-Zimet. 2004. Duplicate Data Elimination in a SAN File System. In MSST 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC.  P. Indyk and R. Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_26_1","volume-title":"Characterization and Exploitation of Narrow-width Loads: The Narrow-width Cache Approach. In CASES","author":"Islam M. M.","year":"2010","unstructured":"M. M. Islam and P. Stenstr\u00a8om . 2010 . Characterization and Exploitation of Narrow-width Loads: The Narrow-width Cache Approach. In CASES 2010 . M. M. Islam and P. Stenstr\u00a8om. 2010. Characterization and Exploitation of Narrow-width Loads: The Narrow-width Cache Approach. In CASES 2010."},{"key":"e_1_3_2_1_27_1","volume-title":"Conference in Modern Analysis and Probability 26","author":"Johnson W.","year":"1982","unstructured":"W. Johnson and J. Lindenstrauss . 1982. Extensions of Lipschitz mappings into a Hilbert space . Conference in Modern Analysis and Probability 26 ( 1982 ), 189--206. W. Johnson and J. Lindenstrauss. 1982. Extensions of Lipschitz mappings into a Hilbert space. Conference in Modern Analysis and Probability 26 (1982), 189--206."},{"key":"e_1_3_2_1_28_1","volume-title":"Bit-plane Compression: Transforming Data for Better Compression in Many-core Architectures. In ISCA","author":"Kim J.","year":"2016","unstructured":"J. Kim , M. Sullivan , E. Choukse , and M. Erez . 2016 . Bit-plane Compression: Transforming Data for Better Compression in Many-core Architectures. In ISCA 2016 . J. Kim, M. Sullivan, E. Choukse, and M. Erez. 2016. Bit-plane Compression: Transforming Data for Better Compression in Many-core Architectures. In ISCA 2016."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"S. Kottapalli and J. Baxter. 2009. Nehalem-EX CPU Architecture. In HotChips 2009.  S. Kottapalli and J. Baxter. 2009. Nehalem-EX CPU Architecture. In HotChips 2009.","DOI":"10.1109\/HOTCHIPS.2009.7478350"},{"key":"e_1_3_2_1_30_1","volume-title":"Very Sparse Random Projections. In KDD","author":"Li P.","year":"2006","unstructured":"P. Li , T. J. Hastie , and K. W. Church . 2006 . Very Sparse Random Projections. In KDD 2006 . P. Li, T. J. Hastie, and K. W. Church. 2006. Very Sparse Random Projections. In KDD 2006."},{"key":"e_1_3_2_1_31_1","volume-title":"ICDE","author":"Liu W.","year":"2019","unstructured":"W. Liu , H. Wang , Y. Zhang , W. Wang , and L. Qin . 2019. I-LSH: I\/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space . In ICDE 2019 . 1670--1673. W. Liu, H. Wang, Y. Zhang, W. Wang, and L. Qin. 2019. I-LSH: I\/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space. In ICDE 2019. 1670--1673."},{"key":"e_1_3_2_1_32_1","volume-title":"Berkeley symposium on mathematical statistics and probability","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen . 1967 . Some methods for classification and analysis of multivariate observations . In Berkeley symposium on mathematical statistics and probability 1967. J. MacQueen. 1967. Some methods for classification and analysis of multivariate observations. In Berkeley symposium on mathematical statistics and probability 1967."},{"key":"e_1_3_2_1_33_1","volume-title":"MICRO","author":"Muralimanohar N.","year":"2007","unstructured":"N. Muralimanohar , R. Balasubramonian , and N. Jouppi . 2007. Optimizing NUCA Organizations and Wiring Alternatives for Large Caches with CACTI 6.0 . In MICRO 2007 . N. Muralimanohar, R. Balasubramonian, and N. Jouppi. 2007. Optimizing NUCA Organizations and Wiring Alternatives for Large Caches with CACTI 6.0. In MICRO 2007."},{"key":"e_1_3_2_1_34_1","volume-title":"MORC: A Manycore-oriented Compressed Cache. In MICRO 2015","author":"Nguyen T. M.","unstructured":"T. M. Nguyen and D. Wentzlaff . 2015 . MORC: A Manycore-oriented Compressed Cache. In MICRO 2015 ( Waikiki, Hawaii). ACM, New York, NY, USA, 76--88. T. M. Nguyen and D. Wentzlaff. 2015. MORC: A Manycore-oriented Compressed Cache. In MICRO 2015 (Waikiki, Hawaii). ACM, New York, NY, USA, 76--88."},{"key":"e_1_3_2_1_35_1","volume-title":"Fast GPU-based Locality Sensitive Hashing for K-nearest Neighbor Computation. In GIS","author":"Pan J.","year":"2011","unstructured":"J. Pan and D. Manocha . 2011 . Fast GPU-based Locality Sensitive Hashing for K-nearest Neighbor Computation. In GIS 2011 . J. Pan and D. Manocha. 2011. Fast GPU-based Locality Sensitive Hashing for K-nearest Neighbor Computation. In GIS 2011."},{"key":"e_1_3_2_1_36_1","volume-title":"Dictionary Sharing: An Efficient Cache Compression Scheme for Compressed Caches. In MICRO","author":"Panda B.","year":"2016","unstructured":"B. Panda and A. Seznec . 2016 . Dictionary Sharing: An Efficient Cache Compression Scheme for Compressed Caches. In MICRO 2016 . B. Panda and A. Seznec. 2016. Dictionary Sharing: An Efficient Cache Compression Scheme for Compressed Caches. In MICRO 2016."},{"key":"e_1_3_2_1_37_1","volume-title":"HPCA","author":"Pekhimenko G.","year":"2015","unstructured":"G. Pekhimenko , T. Huberty , R. Cai , O. Mutlu , P. B. Gibbons , M. A. Kozuch , and T. C. Mowry . 2015. Exploiting compressed block size as an indicator of future reuse . In HPCA 2015 . G. Pekhimenko, T. Huberty, R. Cai, O. Mutlu, P. B. Gibbons, M. A. Kozuch, and T. C. Mowry. 2015. Exploiting compressed block size as an indicator of future reuse. In HPCA 2015."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370870"},{"key":"e_1_3_2_1_39_1","volume-title":"ISCA","author":"Qureshi M. K.","year":"2005","unstructured":"M. K. Qureshi , D. Thompson , and Y. N. Patt . 2005. The V-Way Cache: Demand Based Associativity via Global Replacement . In ISCA 2005 . M. K. Qureshi, D. Thompson, and Y. N. Patt. 2005. The V-Way Cache: Demand Based Associativity via Global Replacement. In ISCA 2005."},{"key":"e_1_3_2_1_40_1","volume-title":"MICRO","author":"Miguel J. San","year":"2016","unstructured":"J. San Miguel , J. Albericio , N. Enright Jerger , and A. Jaleel . 2016. The bunker cache for spatio-value approximation . In MICRO 2016 . J. San Miguel, J. Albericio, N. Enright Jerger, and A. Jaleel. 2016. The bunker cache for spatio-value approximation. In MICRO 2016."},{"key":"e_1_3_2_1_41_1","volume-title":"MICRO","author":"Miguel J. San","year":"2015","unstructured":"J. San Miguel , J. Albericio , A. Moshovos , and N. Enright Jerger . 2015. Doppelg\u00a8anger: a cache for approximate computing . In MICRO 2015 . J. San Miguel, J. Albericio, A. Moshovos, and N. Enright Jerger. 2015. Doppelg\u00a8anger: a cache for approximate computing. In MICRO 2015."},{"key":"e_1_3_2_1_42_1","volume-title":"ZSim: Fast and Accurate Microarchitectural Simulation of Thousand-core Systems. In ISCA","author":"Sanchez D.","year":"2013","unstructured":"D. Sanchez and C. Kozyrakis . 2013 . ZSim: Fast and Accurate Microarchitectural Simulation of Thousand-core Systems. In ISCA 2013 . D. Sanchez and C. Kozyrakis. 2013. ZSim: Fast and Accurate Microarchitectural Simulation of Thousand-core Systems. In ISCA 2013."},{"key":"e_1_3_2_1_43_1","volume-title":"Skewed Compressed Caches. In MICRO","author":"Sardashti S.","year":"2014","unstructured":"S. Sardashti , A. Seznec , and D. A. Wood . 2014 . Skewed Compressed Caches. In MICRO 2014 . S. Sardashti, A. Seznec, and D. A. Wood. 2014. Skewed Compressed Caches. In MICRO 2014."},{"key":"e_1_3_2_1_44_1","volume-title":"Skewed Compressed Caches. In MICRO","author":"Sardashti S.","year":"2014","unstructured":"S. Sardashti , A. Seznec , and D. A. Wood . 2014 . Skewed Compressed Caches. In MICRO 2014 . S. Sardashti, A. Seznec, and D. A. Wood. 2014. Skewed Compressed Caches. In MICRO 2014."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976740"},{"key":"e_1_3_2_1_46_1","volume-title":"Decoupled Compressed Cache: Exploiting Spatial Locality for Energy-optimized Compressed Caching. In MICRO","author":"Sardashti S.","year":"2013","unstructured":"S. Sardashti and D. A. Wood . 2013 . Decoupled Compressed Cache: Exploiting Spatial Locality for Energy-optimized Compressed Caching. In MICRO 2013 . S. Sardashti and D. A. Wood. 2013. Decoupled Compressed Cache: Exploiting Spatial Locality for Energy-optimized Compressed Caching. In MICRO 2013."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2014.42"},{"key":"e_1_3_2_1_48_1","volume-title":"ISSCC","author":"Singh T.","year":"2017","unstructured":"T. Singh , S. Rangarajan , D. John , C. Henrion , S. Southard , H. McIntyre , A. Novak , S. Kosonocky , R. Jotwani , A. Schaefer , E. Chang , J. Bell , and M. Co . 2017. Zen: A next-generation high-performance x86 core . In ISSCC 2017 . T. Singh, S. Rangarajan, D. John, C. Henrion, S. Southard, H. McIntyre, A. Novak, S. Kosonocky, R. Jotwani, A. Schaefer, E. Chang, J. Bell, and M. Co. 2017. Zen: A next-generation high-performance x86 core. In ISSCC 2017."},{"key":"e_1_3_2_1_49_1","volume-title":"Detecting Nearduplicates for Web Crawling. In WWW","author":"Manku G. Singh","year":"2007","unstructured":"G. Singh Manku , A. Jain , and A. Das Sarma . 2007 . Detecting Nearduplicates for Web Crawling. In WWW 2007 . G. Singh Manku, A. Jain, and A. Das Sarma. 2007. Detecting Nearduplicates for Web Crawling. In WWW 2007."},{"key":"e_1_3_2_1_50_1","first-page":"302","article-title":"PageForge: A Near- Memory Content-Aware Page-Merging Architecture","volume":"2017","author":"Skarlatos D.","year":"2017","unstructured":"D. Skarlatos , N. S. Kim , and J. Torrellas . 2017 . PageForge: A Near- Memory Content-Aware Page-Merging Architecture . In MICRO 2017. 302 -- 314 . D. Skarlatos, N. S. Kim, and J. Torrellas. 2017. PageForge: A Near- Memory Content-Aware Page-Merging Architecture. In MICRO 2017. 302--314.","journal-title":"MICRO"},{"key":"e_1_3_2_1_51_1","volume-title":"KDD","author":"Spring R.","year":"2017","unstructured":"R. Spring and A. Shrivastava . 2017. Scalable and Sustainable Deep Learning via Randomized Hashing . In KDD 2017 . R. Spring and A. Shrivastava. 2017. Scalable and Sustainable Deep Learning via Randomized Hashing. In KDD 2017."},{"key":"e_1_3_2_1_52_1","volume-title":"Balanced POWER Server Chip. In HotChips","author":"Starke W. J.","year":"2009","unstructured":"W. J. Starke . 2009. POWER7: IBM's Next Generation , Balanced POWER Server Chip. In HotChips 2009 . W. J. Starke. 2009. POWER7: IBM's Next Generation, Balanced POWER Server Chip. In HotChips 2009."},{"key":"e_1_3_2_1_53_1","volume-title":"MSE","author":"Stine J. E.","year":"2009","unstructured":"J. E. Stine , J. Chen , I. Castellanos , G. Sundararajan , M. Qayam , P. Kumar , J. Remington , and S. Sohoni . 2009. FreePDK v2.0: Transitioning VLSI education towards nanometer variation-aware designs . In MSE 2009 . J. E. Stine, J. Chen, I. Castellanos, G. Sundararajan, M. Qayam, P. Kumar, J. Remington, and S. Sohoni. 2009. FreePDK v2.0: Transitioning VLSI education towards nanometer variation-aware designs. In MSE 2009."},{"key":"e_1_3_2_1_54_1","unstructured":"J. Stuecheli and W. J. Starke. 2018. The IBM POWER9 Scale Up Processor. In HotChips 2018.  J. Stuecheli and W. J. Starke. 2018. The IBM POWER9 Scale Up Processor. In HotChips 2018."},{"key":"e_1_3_2_1_55_1","volume-title":"Last-level Cache Deduplication. In ICS 2014","author":"Tian Y.","unstructured":"Y. Tian , S. M. Khan , D. A. Jim\u00b4enez , and G. H. Loh . 2014 . Last-level Cache Deduplication. In ICS 2014 ( Munich, Germany). 53--62. Y. Tian, S. M. Khan, D. A. Jim\u00b4enez, and G. H. Loh. 2014. Last-level Cache Deduplication. In ICS 2014 (Munich, Germany). 53--62."},{"key":"e_1_3_2_1_56_1","volume-title":"Lines: An Object-Based Compressed Memory Hierarchy. In ASPLOS","author":"Tsai P.-A.","year":"2019","unstructured":"P.-A. Tsai and D. Sanchez . 2019 . Compress Objects , Not Cache Lines: An Object-Based Compressed Memory Hierarchy. In ASPLOS 2019. P.-A. Tsai and D. Sanchez. 2019. Compress Objects, Not Cache Lines: An Object-Based Compressed Memory Hierarchy. In ASPLOS 2019."},{"key":"e_1_3_2_1_57_1","volume-title":"The Case for Compressed Caching in Virtual Memory Systems. In ATEC","author":"Wilson P. R.","year":"1999","unstructured":"P. R. Wilson , S. F. Kaplan , and Y. Smaragdakis . 1999 . The Case for Compressed Caching in Virtual Memory Systems. In ATEC 1999 . P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. 1999. The Case for Compressed Caching in Virtual Memory Systems. In ATEC 1999."},{"key":"e_1_3_2_1_58_1","volume-title":"CIS","author":"Zheng J.","year":"2013","unstructured":"J. Zheng and J. Luo . 2013. A PG-LSH Similarity Search Method for Cloud Storage . In CIS 2013 . J. Zheng and J. Luo. 2013. A PG-LSH Similarity Search Method for Cloud Storage. In CIS 2013."}],"event":{"name":"ASPLOS '20: Architectural Support for Programming Languages and Operating Systems","location":"Lausanne Switzerland","acronym":"ASPLOS '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373376.3378518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373376.3378518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:16Z","timestamp":1750199896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373376.3378518"}},"subtitle":["Efficient Cache Compression via Dynamic Clustering"],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":58,"alternative-id":["10.1145\/3373376.3378518","10.1145\/3373376"],"URL":"https:\/\/doi.org\/10.1145\/3373376.3378518","relation":{},"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"2020-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}