{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:41:34Z","timestamp":1773758494339,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380176","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:16:51Z","timestamp":1588580211000},"page":"973-983","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["PG2S+: Stack Distance Construction Using Popularity, Gap and Machine Learning"],"prefix":"10.1145","author":[{"given":"Jiangwei","family":"Zhang","sequence":"first","affiliation":[{"name":"National University of Singapore"}]},{"given":"Y.C.","family":"Tay","sequence":"additional","affiliation":[{"name":"National University of Singapore"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"George Alm\u00e1si C\u01celin Ca\u015fcaval and David\u00a0A. Padua. 2002. Calculating Stack Distances Efficiently. In MSP. 37\u201343.  George Alm\u00e1si C\u01celin Ca\u015fcaval and David\u00a0A. Padua. 2002. Calculating Stack Distances Efficiently. In MSP. 37\u201343.","DOI":"10.1145\/773039.773043"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"e_1_3_2_1_3_1","first-page":"20","article-title":"StatCache: a probabilistic approach to efficient and accurate data locality analysis","volume":"2004","author":"Berg E.","year":"2004","unstructured":"E. Berg and E. Hagersten . 2004 . StatCache: a probabilistic approach to efficient and accurate data locality analysis . In IEEE ISPASS , 2004. 20 \u2013 27 . E. Berg and E. Hagersten. 2004. StatCache: a probabilistic approach to efficient and accurate data locality analysis. In IEEE ISPASS, 2004. 20\u201327.","journal-title":"IEEE ISPASS"},{"key":"e_1_3_2_1_4_1","unstructured":"Daniel Byrne. 2018. A Survey of Miss-Ratio Curve Construction Techniques. CoRR abs\/1804.01972(2018).  Daniel Byrne. 2018. A Survey of Miss-Ratio Curve Construction Techniques. CoRR abs\/1804.01972(2018)."},{"key":"e_1_3_2_1_5_1","volume-title":"Cliffhanger: Scaling Performance Cliffs in Web Memory Caches. In NSDI. 379\u2013392.","author":"Cidon Asaf","year":"2016","unstructured":"Asaf Cidon , Assaf Eisenman , Mohammad Alizadeh , and Sachin Katti . 2016 . Cliffhanger: Scaling Performance Cliffs in Web Memory Caches. In NSDI. 379\u2013392. Asaf Cidon, Assaf Eisenman, Mohammad Alizadeh, and Sachin Katti. 2016. Cliffhanger: Scaling Performance Cliffs in Web Memory Caches. In NSDI. 379\u2013392."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.689650"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781159"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"D. Eklov and E. Hagersten. 2010. StatStack: Efficient modeling of LRU caches. In IEEE ISPASS. 55\u201365.  D. Eklov and E. Hagersten. 2010. StatStack: Efficient modeling of LRU caches. In IEEE ISPASS. 55\u201365.","DOI":"10.1109\/ISPASS.2010.5452069"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"L. He Z. Yu and H. Jin. 2012. FractalMRC: Online Cache Miss Rate Curve Prediction on Commodity Systems. In IEEE IPDPS. 1341\u20131351.  L. He Z. Yu and H. Jin. 2012. FractalMRC: Online Cache Miss Rate Curve Prediction on Commodity Systems. In IEEE IPDPS. 1341\u20131351.","DOI":"10.1109\/IPDPS.2012.121"},{"key":"e_1_3_2_1_10_1","volume-title":"LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Hu Xiameng","year":"2015","unstructured":"Xiameng Hu , Xiaolin Wang , Yechen Li , Lan Zhou , Yingwei Luo , Chen Ding , Song Jiang , and Zhenlin Wang . 2015 . LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15) . 57\u201369. Xiameng Hu, Xiaolin Wang, Yechen Li, Lan Zhou, Yingwei Luo, Chen Ding, Song Jiang, and Zhenlin Wang. 2015. LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). 57\u201369."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026959.3026992"},{"key":"e_1_3_2_1_12_1","unstructured":"Cliff\u00a0Young Kaz\u00a0Sato and David Patterson. 2017. An in-depth look at Google\u2019s first Tensor Processing Unit (TPU). https:\/\/cloud.google.com\/blog\/products\/gcp\/an-in-depth-look-at-googles-first-tensor-processing-unit-tpu  Cliff\u00a0Young Kaz\u00a0Sato and David Patterson. 2017. An in-depth look at Google\u2019s first Tensor Processing Unit (TPU). https:\/\/cloud.google.com\/blog\/products\/gcp\/an-in-depth-look-at-googles-first-tensor-processing-unit-tpu"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/107972.107995"},{"key":"e_1_3_2_1_14_1","volume-title":"SIGMOD(SIGMOD \u201918)","author":"Kraska Tim","unstructured":"Tim Kraska , Alex Beutel , Ed\u00a0 H. Chi , Jeffrey Dean , and Neoklis Polyzotis . 2018. The Case for Learned Index Structures . In SIGMOD(SIGMOD \u201918) . ACM , New York, NY, USA , 489\u2013504. Tim Kraska, Alex Beutel, Ed\u00a0H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In SIGMOD(SIGMOD \u201918). ACM, New York, NY, USA, 489\u2013504."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_1_16_1","first-page":"10","article-title":"Write off-loading: Practical power management for enterprise storage","volume":"4","author":"Narayanan Dushyanth","year":"2008","unstructured":"Dushyanth Narayanan , Austin Donnelly , and Antony Rowstron . 2008 . Write off-loading: Practical power management for enterprise storage . ACM TOS 4 , 3 (2008), 10 . Dushyanth Narayanan, Austin Donnelly, and Antony Rowstron. 2008. Write off-loading: Practical power management for enterprise storage. ACM TOS 4, 3 (2008), 10.","journal-title":"ACM TOS"},{"key":"e_1_3_2_1_17_1","volume-title":"PARDA: A fast parallel reuse distance analysis algorithm","author":"Niu Qingpeng","year":"2012","unstructured":"Qingpeng Niu , James Dinan , Qingda Lu , and Ponnuswamy Sadayappan . 2012 . PARDA: A fast parallel reuse distance analysis algorithm . In IEEE IPDPS. 1284\u20131294. Qingpeng Niu, James Dinan, Qingda Lu, and Ponnuswamy Sadayappan. 2012. PARDA: A fast parallel reuse distance analysis algorithm. In IEEE IPDPS. 1284\u20131294."},{"key":"e_1_3_2_1_18_1","volume-title":"Efficient methods for calculating the success function of fixed space replacement polities. Performance Evaluation 3 (05","author":"Olken Frank","year":"1983","unstructured":"Frank Olken . 1983. Efficient methods for calculating the success function of fixed space replacement polities. Performance Evaluation 3 (05 1983 ). Frank Olken. 1983. Efficient methods for calculating the success function of fixed space replacement polities. Performance Evaluation 3 (05 1983)."},{"key":"e_1_3_2_1_19_1","first-page":"6","article-title":"The Role of Caching in Future Communication Systems and Networks","volume":"36","author":"Paschos S.","year":"2018","unstructured":"G.\u00a0 S. Paschos , G. Iosifidis , M. Tao , D. Towsley , and G. Caire . 2018 . The Role of Caching in Future Communication Systems and Networks . IEEE Journal on Selected Areas in Communications 36 , 6 (June 2018), 1111\u20131125. G.\u00a0S. Paschos, G. Iosifidis, M. Tao, D. Towsley, and G. Caire. 2018. The Role of Caching in Future Communication Systems and Networks. IEEE Journal on Selected Areas in Communications 36, 6 (June 2018), 1111\u20131125.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"e_1_3_2_1_20_1","volume-title":"Modeling Cache Sharing on Chip Multiprocessor Architectures","author":"Petoumenos Pavlos","unstructured":"Pavlos Petoumenos , Georgios Keramidas , H\u00e5kan Zeffer , Stefanos Kaxiras , and Erik Hagersten . 2006. Modeling Cache Sharing on Chip Multiprocessor Architectures . In IEEE IISWC. 160\u2013171. Pavlos Petoumenos, Georgios Keramidas, H\u00e5kan Zeffer, Stefanos Kaxiras, and Erik Hagersten. 2006. Modeling Cache Sharing on Chip Multiprocessor Architectures. In IEEE IISWC. 160\u2013171."},{"key":"e_1_3_2_1_21_1","volume-title":"International Symposium on Microarchitecture. 423\u2013432","author":"K.","unstructured":"Moinuddin\u00a0 K. Qureshi and Yale\u00a0N. Patt. 2006. Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches . In International Symposium on Microarchitecture. 423\u2013432 . Moinuddin\u00a0K. Qureshi and Yale\u00a0N. Patt. 2006. Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches. In International Symposium on Microarchitecture. 423\u2013432."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Dynamic Performance Profiling of Cloud Caches","volume":"28","author":"Saemundsson Trausti","year":"2014","unstructured":"Trausti Saemundsson , Hjortur Bjornsson , Gregory Chockler , and Ymir Vigfusson . 2014 . Dynamic Performance Profiling of Cloud Caches . In SOCC. 28 : 1 \u2013 28 :14. Trausti Saemundsson, Hjortur Bjornsson, Gregory Chockler, and Ymir Vigfusson. 2014. Dynamic Performance Profiling of Cloud Caches. In SOCC. 28:1\u201328:14.","journal-title":"SOCC."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"D.\u00a0L. Schuff M. Kulkarni and V.\u00a0S. Pai. 2010. Accelerating multicore reuse distance analysis with sampling and parallelization. In PACT. 53\u201363.  D.\u00a0L. Schuff M. Kulkarni and V.\u00a0S. Pai. 2010. Accelerating multicore reuse distance analysis with sampling and parallelization. In PACT. 53\u201363.","DOI":"10.1145\/1854273.1854286"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190215.1190227"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508284.1508259"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.007"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.30852"},{"key":"e_1_3_2_1_29_1","unstructured":"Carl\u00a0A. Waldspurger Nohhyun Park Alexander Garthwaite and Irfan Ahmad. 2015. Efficient MRC Construction with SHARDS. In FAST. 95\u2013110.  Carl\u00a0A. Waldspurger Nohhyun Park Alexander Garthwaite and Irfan Ahmad. 2015. Efficient MRC Construction with SHARDS. In FAST. 95\u2013110."},{"key":"e_1_3_2_1_30_1","unstructured":"Jake Wires Stephen Ingram Zachary Drudi Nicholas J.\u00a0A. Harvey and Andrew Warfield. 2014. Characterizing Storage Workloads with Counter Stacks. In OSDI. 335\u2013349.  Jake Wires Stephen Ingram Zachary Drudi Nicholas J.\u00a0A. Harvey and Andrew Warfield. 2014. Characterizing Storage Workloads with Counter Stacks. In OSDI. 335\u2013349."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Liang Yuan Chen Ding Wesley Smith Peter Denning and Yunquan Zhang. 2019. A Relational Theory of Locality. ACM Trans. Archit. Code Optim.(2019).  Liang Yuan Chen Ding Wesley Smith Peter Denning and Yunquan Zhang. 2019. A Relational Theory of Locality. ACM Trans. Archit. Code Optim.(2019).","DOI":"10.1145\/3341109"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Yutao Zhong and Wentao Chang. 2008. Sampling-based Program Locality Approximation. In ISMM. 91\u2013100.  Yutao Zhong and Wentao Chang. 2008. Sampling-based Program Locality Approximation. In ISMM. 91\u2013100.","DOI":"10.1145\/1375634.1375648"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1552309.1552310"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037949.1024415"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380176","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:00Z","timestamp":1750199580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":33,"alternative-id":["10.1145\/3366423.3380176","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380176","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}