{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:13:53Z","timestamp":1768029233525,"version":"3.49.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2004CB318205"],"award-info":[{"award-number":["2004CB318205"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2009AA01A403"],"award-info":[{"award-number":["2009AA01A403"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["10576018"],"award-info":[{"award-number":["10576018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-05-0067"],"award-info":[{"award-number":["NCET-05-0067"]}],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>With the development of storage technology and applications, new caching policies are continuously being introduced. It becomes increasingly important for storage systems to be able to select the matched caching policy dynamically under varying workloads. This article proposes SOPA, a cache framework to adaptively select the matched policy and perform policy switches in storage systems. SOPA encapsulates the functions of a caching policy into a module, and enables online policy switching by policy reconstruction. SOPA then selects the policy matched with the workload dynamically by collecting and analyzing access traces. To reduce the decision-making cost, SOPA proposes an asynchronous decision making process. The simulation experiments show that no single caching policy performed well under all of the different workloads. With SOPA, a storage system could select the appropriate policy for different workloads. The real-system evaluation results show that SOPA reduced the average response time by up to 20.3% and 11.9% compared with LRU and ARC, respectively.<\/jats:p>","DOI":"10.1145\/1807060.1807064","type":"journal-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:03Z","timestamp":1280239803000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["SOPA"],"prefix":"10.1145","volume":"6","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Jiwu","family":"Shu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Guangyan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Wei","family":"Xue","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Weimin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2010,7,30]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Workshop on Distributed Data and Structures","author":"Ari I.","year":"2002","unstructured":"Ari , I. , Amer , A. , Gramarcy , R. , Miller , E. , Brandt , S. , and Long , D . 2002. ACME: Adaptive caching using multiple experts . In Proceedings of the Workshop on Distributed Data and Structures , Carleton Scientific , 2002 . Ari, I., Amer, A., Gramarcy, R., Miller, E., Brandt, S., and Long, D. 2002. ACME: Adaptive caching using multiple experts. In Proceedings of the Workshop on Distributed Data and Structures, Carleton Scientific, 2002."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the International Conference on Autonomic Computing (ICAC).","author":"Ari I.","unstructured":"Ari , I. , Gottwals , M. , and Henze , D . 2004. SANBoost: Automated SAN-Level caching in storage area networks , In Proceedings of the International Conference on Autonomic Computing (ICAC). Ari, I., Gottwals, M., and Henze, D. 2004. SANBoost: Automated SAN-Level caching in storage area networks, In Proceedings of the International Conference on Autonomic Computing (ICAC)."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the USENIX File and. Storage Technologies Conference (FAST), 142--163","author":"Bansal S.","unstructured":"Bansal , S. and Modha , D. S . 2004. CAR: Clock with adaptive replacement . In Proceedings of the USENIX File and. Storage Technologies Conference (FAST), 142--163 . Bansal, S. and Modha, D. S. 2004. CAR: Clock with adaptive replacement. In Proceedings of the USENIX File and. Storage Technologies Conference (FAST), 142--163."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the USENIX Symposium on Internet Technologies and Systems.","author":"Cao P.","unstructured":"Cao . P. and Irani , S . 1997. Cost-aware WWW proxy caching algorithms . In Proceedings of the USENIX Symposium on Internet Technologies and Systems. Cao. P. and Irani, S. 1997. Cost-aware WWW proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the USENIX Annual Technical Conference, 269--281","author":"Chen Z.","unstructured":"Chen , Z. , Zhou , Y. , and Li , K . 2003. Eviction-based cache placement for storage caches . In Proceedings of the USENIX Annual Technical Conference, 269--281 . Chen, Z., Zhou, Y., and Li, K. 2003. Eviction-based cache placement for storage caches. In Proceedings of the USENIX Annual Technical Conference, 269--281."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064230"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the VLDB Conference.","author":"Chou H. T.","unstructured":"Chou , H. T. and Dewitt , D. J . 1985. An evaluation of buffer management strategies for relational database systems . In Proceedings of the VLDB Conference. Chou, H. T. and Dewitt, D. J. 1985. An evaluation of buffer management strategies for relational database systems. In Proceedings of the VLDB Conference."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST).","author":"Gill B. S.","unstructured":"Gill , B. S. and Modha , D. S . 2005. WOW: Wise ordering for writes&quest;combining spatial and temporal locality in non-volatile caches . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). Gill, B. S. and Modha, D. S. 2005. WOW: Wise ordering for writes&quest;combining spatial and temporal locality in non-volatile caches. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_9_1","unstructured":"HP TRACES. http:\/\/tesla.hpl.hp.com\/public_software\/  HP TRACES. http:\/\/tesla.hpl.hp.com\/public_software\/"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/511334.511340"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (Fast).","author":"Jiang S.","year":"2005","unstructured":"Jiang . S. , Ding , X. , Chen , F. , Tan , E. , and Zhang . X. 2005 . DULO: An effective buffer cache management scheme to exploit both temporal and spatial localities . In Proceedings of the USENIX Conference on File and Storage Technologies (Fast). Jiang. S., Ding, X., Chen, F., Tan, E., and Zhang. X. 2005. DULO: An effective buffer cache management scheme to exploit both temporal and spatial localities. In Proceedings of the USENIX Conference on File and Storage Technologies (Fast)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the VLDB Conference. 297--306","author":"Johnson T.","unstructured":"Johnson , T. and Shasha , D . 1994. 2Q: A low overhead high performance buffer management replacement algorithm ,\u201d In Proceedings of the VLDB Conference. 297--306 . Johnson, T. and Shasha, D. 1994. 2Q: A low overhead high performance buffer management replacement algorithm,\u201d In Proceedings of the VLDB Conference. 297--306."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2001.970573"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST), 115--128","author":"Li X.","unstructured":"Li , X. , Aboulnaga , A. , Sachedina , A. , Salem , K. , and Gao , S. B . 2005. Second-tier cache management using write hints . In Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST), 115--128 . Li, X., Aboulnaga, A., Sachedina, A., Salem, K., and Gao, S. B. 2005. Second-tier cache management using write hints. In Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST), 115--128."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the USENIX Technical Conference. 279--295","author":"Mcvoy L.","unstructured":"Mcvoy , L. and Staelin , C . 1996. lmbench: Portable tools for performance analysis . In Proceedings of the USENIX Technical Conference. 279--295 . Mcvoy, L. and Staelin, C. 1996. lmbench: Portable tools for performance analysis. In Proceedings of the USENIX Technical Conference. 279--295."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the USENIX File and Storage Technologies Conference (FAST), 115--130","author":"Megiddo N.","unstructured":"Megiddo , N. and Modha , D. S . 2003. ARC: A self-tuning, low overhead replacement cache . In Proceedings of the USENIX File and Storage Technologies Conference (FAST), 115--130 . Megiddo, N. and Modha, D. S. 2003. ARC: A self-tuning, low overhead replacement cache. In Proceedings of the USENIX File and Storage Technologies Conference (FAST), 115--130."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01266331"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the IEEE Computer Society International COMPCON Conference.","author":"Menon J.","unstructured":"Menon , J. and Hartung , M . 1988. The IBM 3990 disk cache . In Proceedings of the IEEE Computer Society International COMPCON Conference. Menon, J. and Hartung, M. 1988. The IBM 3990 disk cache. In Proceedings of the IEEE Computer Society International COMPCON Conference."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/35037.42183"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170081"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/98457.98523"},{"key":"e_1_2_1_22_1","unstructured":"Ruemmler C. and Wilkes J. 1993. A trace-driven analysis of disk working set sizes. Tech. rep. HPL{OSR{93{23 Hewlett-Packard Laboratories Palo Alto CA USA.  Ruemmler C. and Wilkes J. 1993. A trace-driven analysis of disk working set sizes. Tech. rep. HPL{OSR{93{23 Hewlett-Packard Laboratories Palo Alto CA USA."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Workshop on Algorithms and Architectures for Self-Managing Systems.","author":"Salmon B.","unstructured":"Salmon , B. , Thereska , E. , Soules , C. A. N , and Ganger , G. R . 2003. A two-tiered software architecture for automated tuning of disk layouts . In Proceedings of the Workshop on Algorithms and Architectures for Self-Managing Systems. Salmon, B., Thereska, E., Soules, C. A. N, and Ganger, G. R. 2003. A two-tiered software architecture for automated tuning of disk layouts. In Proceedings of the Workshop on Algorithms and Architectures for Self-Managing Systems."},{"key":"e_1_2_1_24_1","unstructured":"SPC-1 TRACES. http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage  SPC-1 TRACES. http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage"},{"key":"e_1_2_1_25_1","unstructured":"TPC-C TRACE. http:\/\/tds.cs.byu.edu\/tds\/tracelist.jsp?searchby=attribute&type=Disk+I%2FO&length=All&platform=All&cache=All&pageNum=0&searchAction=Go&x=52&y=19  TPC-C TRACE. http:\/\/tds.cs.byu.edu\/tds\/tracelist.jsp?searchby=attribute&type=Disk+I%2FO&length=All&platform=All&cache=All&pageNum=0&searchAction=Go&x=52&y=19"},{"key":"e_1_2_1_26_1","unstructured":"UNH PROJECT. 2006. http:\/\/unh-iscsi.sourceforge.net\/  UNH PROJECT. 2006. http:\/\/unh-iscsi.sourceforge.net\/"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the USENIX File and Storage Technologies Conference (FAST).","author":"Yadgar G.","unstructured":"Yadgar , G. and Factor , M . 2007. Karma: Know-it-all replacement for a multilevel cache . In Proceedings of the USENIX File and Storage Technologies Conference (FAST). Yadgar, G. and Factor, M. 2007. Karma: Know-it-all replacement for a multilevel cache. In Proceedings of the USENIX File and Storage Technologies Conference (FAST)."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the USENIX Annual Technical Conference. 91--104","author":"Zhou Y.","unstructured":"Zhou , Y. and Philbin , J. F . 2001. The multi-queue replacement algorithm for second level buffer caches . In Proceedings of the USENIX Annual Technical Conference. 91--104 . Zhou, Y. and Philbin, J. F. 2001. The multi-queue replacement algorithm for second level buffer caches. In Proceedings of the USENIX Annual Technical Conference. 91--104."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807060.1807064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807060.1807064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:34Z","timestamp":1750249054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807060.1807064"}},"subtitle":["Selecting the optimal caching policy adaptively"],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1145\/1807060.1807064"],"URL":"https:\/\/doi.org\/10.1145\/1807060.1807064","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"2010-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}