乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T16:30:22Z","timestamp":1712766622709},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T00:00:00Z","timestamp":1555027200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CSR-1618384, CSR-1422342, CCF-1717877, CCF-1629376, and CNS-1319617"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IBM CAS Faculty Fellowship"},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61232008, 61472008, 61672053, and U1611461"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Key Research","award":["JCYJ20170412150946024"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"The reuse distance (least recently used (LRU) stack distance) is an essential metric for performance prediction and optimization of storage cache. Over the past four decades, there have been steady improvements in the algorithmic efficiency of reuse distance measurement. This progress is accelerating in recent years, both in theory and practical implementation.<\/jats:p>\n In this article, we present a kinetic model of LRU cache memory, based on the average eviction time (AET) of the cached data. The AET model enables fast measurement and use of low-cost sampling. It can produce the miss ratio curve in linear time with extremely low space costs. On storage trace benchmarks, AET reduces the time and space costs compared to former techniques. Furthermore, AET is a composable model that can characterize shared cache behavior through sampling and modeling individual programs or traces.<\/jats:p>","DOI":"10.1145\/3185751","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T12:10:20Z","timestamp":1523621420000},"page":"1-34","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Fast Miss Ratio Curve Modeling for Storage Cache"],"prefix":"10.1145","volume":"14","author":[{"given":"Xiameng","family":"Hu","sequence":"first","affiliation":[{"name":"Peking University, Beijing, P.R.China"}]},{"given":"Xiaolin","family":"Wang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, P.R.China"}]},{"given":"Lan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, P.R.China"}]},{"given":"Yingwei","family":"Luo","sequence":"additional","affiliation":[{"name":"Peking University; Shenzhen Key Lab for Cloud Computing Technology 8 Applications, SECE, Peking University, SHENZHEN"}]},{"given":"Zhenlin","family":"Wang","sequence":"additional","affiliation":[{"name":"Michigan Technological University, Townsend Drive, Houghton, MI"}]},{"given":"Chen","family":"Ding","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, NY"}]},{"given":"Chencheng","family":"Ye","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, P.R.China"}]}],"member":"320","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Probability, Statistics, and Queueing Theory","author":"Allen Arnold O.","unstructured":"Arnold O. Allen . 2014. Probability, Statistics, and Queueing Theory . Academic Press . Arnold O. Allen. 2014. Probability, Statistics, and Queueing Theory. Academic Press."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/773146.773043"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.43"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11847366_23"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2527081"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.84"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921017"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.32"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.27"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the USENIX Annual Technical Conference, General Track. 269--281","author":"Chen Zhifeng","year":"2003","unstructured":"Zhifeng Chen , Yuanyuan Zhou , and Kai Li . 2003 . Eviction-based cache placement for storage caches . In Proceedings of the USENIX Annual Technical Conference, General Track. 269--281 . Zhifeng Chen, Yuanyuan Zhou, and Kai Li. 2003. Eviction-based cache placement for storage caches. In Proceedings of the USENIX Annual Technical Conference, General Track. 269--281."},{"key":"e_1_2_1_11_1","volume-title":"Denning","author":"Coffman Edward Grady","year":"1973","unstructured":"Edward Grady Coffman and Peter J . Denning . 1973 . Operating Systems Theory. Vol. 973 . Prentice-Hall Englewood Cliffs , NJ. Edward Grady Coffman and Peter J. Denning. 1973. Operating Systems Theory. Vol. 973. Prentice-Hall Englewood Cliffs, NJ."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/363095.363141"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.230464"},{"key":"e_1_2_1_14_1","volume-title":"Great Principles of Computing","author":"Denning Peter J.","unstructured":"Peter J. Denning , Craig H. Martell , and Vint Cerf . 2015. Great Principles of Computing . MIT Press . Peter J. Denning, Craig H. Martell, and Vint Cerf. 2015. Great Principles of Computing. MIT Press."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/361268.361281"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/359588.359598"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-014-1460-7"},{"key":"e_1_2_1_18_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"40","author":"Drudi Zachary","year":"2015","unstructured":"Zachary Drudi , Nicholas J. A. Harvey , Stephen Ingram , Andrew Warfield , and Jake Wires . 2015 . Approximating hit rate curves using streaming algorithms . In LIPIcs-Leibniz International Proceedings in Informatics , Vol. 40 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, and Jake Wires. 2015. Approximating hit rate curves using streaming algorithms. In LIPIcs-Leibniz International Proceedings in Informatics, Vol. 40. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the International Conference on Parallel Architecture and Compilation Techniques","author":"Duesterwald E.","unstructured":"E. Duesterwald , C. Cascaval , and S. Dwarkadas . 2003. Characterizing and predicting program behavior and its variability . In Proceedings of the International Conference on Parallel Architecture and Compilation Techniques . New Orleans, Louisiana. E. Duesterwald, C. Cascaval, and S. Dwarkadas. 2003. Characterizing and predicting program behavior and its variability. In Proceedings of the International Conference on Parallel Architecture and Compilation Techniques. New Orleans, Louisiana."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2010.5452069"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 2007 International Conference on Analysis of Algorithms (AofA\u201907)","author":"Fusy \u00c9ric","year":"2007","unstructured":"\u00c9ric Fusy , G. Olivier , and Fr\u00e9d\u00e9ric Meunier . 2007 . Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm . In Proceedings of the 2007 International Conference on Analysis of Algorithms (AofA\u201907) . \u00c9ric Fusy, G. Olivier, and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. In Proceedings of the 2007 International Conference on Analysis of Algorithms (AofA\u201907)."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4.","author":"Gill Binny S.","year":"2008","unstructured":"Binny S. Gill . 2008 . On multi-level exclusive caching: Offline optimality and why promotions are better than demotions . In Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4. Binny S. Gill. 2008. On multi-level exclusive caching: Offline optimality and why promotions are better than demotions. In Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of USENIX Annual Technical Conference.","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 Proceedings of USENIX Annual Technical Conference. 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 Proceedings of USENIX Annual Technical Conference."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511340"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_15"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176760.1176774"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/107971.107995"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_2_1_29_1","first-page":"115","article-title":"ARC: A self-tuning, low overhead replacement cache","volume":"3","author":"Megiddo Nimrod","year":"2003","unstructured":"Nimrod Megiddo and Dharmendra S. Modha . 2003 . ARC: A self-tuning, low overhead replacement cache . In FAST , Vol. 3. 115 -- 130 . Nimrod Megiddo and Dharmendra S. Modha. 2003. ARC: A self-tuning, low overhead replacement cache. In FAST, Vol. 3. 115--130.","journal-title":"FAST"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416944.1416949"},{"key":"e_1_2_1_31_1","volume-title":"Efficient Methods for Calculating the Success Function of Fixed-space Replacement Policies","author":"Olken Frank","unstructured":"Frank Olken . 1981a. Efficient Methods for Calculating the Success Function of Fixed-space Replacement Policies . Technical Report. Lawrence Berkeley Lab, CA. Frank Olken. 1981a. Efficient Methods for Calculating the Success Function of Fixed-space Replacement Policies. Technical Report. Lawrence Berkeley Lab, CA."},{"key":"e_1_2_1_32_1","volume-title":"Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies","author":"Olken F.","unstructured":"F. Olken . 1981b. Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies . Technical Report LBL-12370. Lawrence Berkeley Laboratory . F. Olken. 1981b. Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies. Technical Report LBL-12370. Lawrence Berkeley Laboratory."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854286"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190215.1190227"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/355620.361167"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377797"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591635.2667181"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508259"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of USENIX ATC. 487--498","author":"Waldspurger Carl","year":"2017","unstructured":"Carl Waldspurger , Trausti Saemundsson , Irfan Ahmad , and Nohhyun Park . 2017 . Cache modeling and optimization using miniature simulations . In Proceedings of USENIX ATC. 487--498 . Carl Waldspurger, Trausti Saemundsson, Irfan Ahmad, and Nohhyun Park. 2017. Cache modeling and optimization using miniature simulations. In Proceedings of USENIX ATC. 487--498."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750490"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Xiaolin Wang Yechen Li Yingwei Luo Xiameng Hu Jacob Brock Chen Ding and Zhenlin Wang. 2015. Optimal footprint symbiosis in shared cache. In CCGRID. Xiaolin Wang Yechen Li Yingwei Luo Xiameng Hu Jacob Brock Chen Ding and Zhenlin Wang. 2015. Optimal footprint symbiosis in shared cache. In CCGRID.","DOI":"10.1109\/CCGrid.2015.153"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685075"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the USENIX Annual Technical Conference, General Track. 161--175","author":"Theodore","unstructured":"Theodore M. Wong and John Wilkes. 2002. My cache or yours? Making storage more exclusive . In Proceedings of the USENIX Annual Technical Conference, General Track. 161--175 . Theodore M. Wong and John Wilkes. 2002. My cache or yours? Making storage more exclusive. In Proceedings of the USENIX Annual Technical Conference, General Track. 161--175."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941567"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.66"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451153"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.29"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519076"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375648"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1552309.1552310"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037949.1024415"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3185751","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3185751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T21:31:00Z","timestamp":1672522260000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3185751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,12]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3185751"],"URL":"https:\/\/doi.org\/10.1145\/3185751","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,12]]},"assertion":[{"value":"2017-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}