{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:51:06Z","timestamp":1745038266294,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T00:00:00Z","timestamp":1521417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science and Technology, R.O.C.","award":["MOST 104-2221-E-002-099-MY3"],"award-info":[{"award-number":["MOST 104-2221-E-002-099-MY3"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11227-018-2311-z","type":"journal-article","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T06:51:04Z","timestamp":1521442264000},"page":"2729-2746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Time-shift replacement algorithm for main memory performance optimization"],"prefix":"10.1007","volume":"74","author":[{"given":"Hong-Bin","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9011-5025","authenticated-orcid":false,"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,19]]},"reference":[{"issue":"1","key":"2311_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/321623.321632","volume":"18","author":"AV Aho","year":"1971","unstructured":"Aho AV, Denning PJ, Ullman JD (1971) Principles of optimal page replacement. J ACM 18(1):80\u201393. https:\/\/doi.org\/10.1145\/321623.321632","journal-title":"J ACM"},{"unstructured":"Bansal S, Modha DS (2004) CAR: clock with adaptive replacement. In: Proceedings of the 3rd USENIX Conference on File and Storage Technologies, USENIX Association, Berkeley, CA, USA, FAST \u201904, pp 187\u2013200. http:\/\/dl.acm.org\/citation.cfm?id=1096673.1096699","key":"2311_CR2"},{"issue":"2","key":"2311_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA B\u00e9l\u00e1dy","year":"1966","unstructured":"B\u00e9l\u00e1dy LA (1966) A study of replacement algorithms for a virtual-storage computer. IBM Syst J 5(2):78\u2013101. https:\/\/doi.org\/10.1147\/sj.52.0078","journal-title":"IBM Syst J"},{"unstructured":"Berger DS, Sitaraman RK, Harchol-Balter M (2017) AdaptSize: orchestrating the hot object memory cache in a content delivery network. In: Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, USENIX Association, Boston, MA, NSDI \u201917, pp 483\u2013498. https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/berger","key":"2311_CR4"},{"doi-asserted-by":"publisher","unstructured":"Floratou A, Megiddo N, Potti N, \u00d6zcan F, Kale U, Schmitz-Hermes J (2016) Adaptive caching in big SQL using the HDFS cache. In: Proceedings of the 7th ACM Symposium on Cloud Computing, ACM, New York, NY, USA, SoCC \u201916, pp 321\u2013333. https:\/\/doi.org\/10.1145\/2987550.2987553","key":"2311_CR5","DOI":"10.1145\/2987550.2987553"},{"unstructured":"Gill BS, Modha DS (2005) SARC: sequential prefetching in adaptive replacement cache. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, USENIX Association, Berkeley, CA, USA, ATEC \u201905, pp 33\u201333. http:\/\/dl.acm.org\/citation.cfm?id=1247360.1247393","key":"2311_CR6"},{"doi-asserted-by":"publisher","unstructured":"Hong B, Kwon Y, Ahn JH, Kim J (2016) Adaptive and flexible key-value stores through soft data partitioning. In: Proceedings of the 34th IEEE International Conference on Computer Design, IEEE Press, Phoenix, AZ, USA, ICCD \u201916, pp 296\u2013303. https:\/\/doi.org\/10.1109\/ICCD.2016.7753293","key":"2311_CR7","DOI":"10.1109\/ICCD.2016.7753293"},{"issue":"2","key":"2311_CR8","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2737832","volume":"12","author":"S Huang","year":"2016","unstructured":"Huang S, Wei Q, Feng D, Chen J, Chen C (2016) Improving flash-based disk cache with lazy adaptive replacement. Trans Storage 12(2):8:1\u20138:24. https:\/\/doi.org\/10.1145\/2737832","journal-title":"Trans Storage"},{"issue":"1","key":"2311_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/511399.511340","volume":"30","author":"S Jiang","year":"2002","unstructured":"Jiang S, Zhang X (2002) LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. SIGMETRICS Perform Eval Rev 30(1):31\u201342. https:\/\/doi.org\/10.1145\/511399.511340","journal-title":"SIGMETRICS Perform Eval Rev"},{"unstructured":"Johnson T, Shasha D (1994) 2Q: a low overhead high performance buffer management replacement algorithm. In: Proceedings of the 20th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, VLDB \u201994, pp 439\u2013450. http:\/\/dl.acm.org\/citation.cfm?id=645920.672996","key":"2311_CR10"},{"issue":"3","key":"2311_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.268884","volume":"27","author":"R Karedla","year":"1994","unstructured":"Karedla R, Love JS, Wherry BG (1994) Caching strategies to improve disk system performance. Computer 27(3):38\u201346. https:\/\/doi.org\/10.1109\/2.268884","journal-title":"Computer"},{"doi-asserted-by":"publisher","unstructured":"Kim D, Bahn H (2017) Exploiting write-only-once characteristics of file data in smartphone buffer cache management. Pervasive Mobile Comput. https:\/\/doi.org\/10.1016\/j.pmcj.2017.01.004 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1574119216301948","key":"2311_CR12","DOI":"10.1016\/j.pmcj.2017.01.004"},{"issue":"3","key":"2311_CR13","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1837915.1837921","volume":"6","author":"R Koller","year":"2010","unstructured":"Koller R, Rangaswami R (2010) I\/O deduplication: utilizing content similarity to improve I\/O performance. Trans Storage 6(3):13:1\u201313:26. https:\/\/doi.org\/10.1145\/1837915.1837921","journal-title":"Trans Storage"},{"unstructured":"Laboratory for Advanced System Software (2013) UMass trace repository. http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage . Accessed 13 Feb 2017","key":"2311_CR14"},{"issue":"12","key":"2311_CR15","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D Lee","year":"2001","unstructured":"Lee D, Choi J, Kim JH, Noh SH, Min SL, Cho Y, Kim CS (2001) LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans Comput 50(12):1352\u20131361. https:\/\/doi.org\/10.1109\/TC.2001.970573","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"2311_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TCE.2016.7448559","volume":"62","author":"M Lin","year":"2016","unstructured":"Lin M, Yao Z, Xiong J (2016) History-aware page replacement algorithm for NAND flash-based consumer electronics. IEEE Trans Consum Electron 62(1):23\u201329. https:\/\/doi.org\/10.1109\/TCE.2016.7448559","journal-title":"IEEE Trans Consum Electron"},{"unstructured":"Luo T, Ma S, Lee R, Zhang X, Liu D, Zhou L (2013) S-CAVE: effective SSD caching to improve virtual machine storage performance. In: Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, IEEE Press, Piscataway, NJ, USA, PACT \u201913, pp 103\u2013112. http:\/\/dl.acm.org\/citation.cfm?id=2523721.2523739","key":"2311_CR17"},{"issue":"6","key":"2311_CR18","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TC.2015.2455978","volume":"65","author":"M Tarihi","year":"2016","unstructured":"Tarihi M, Asadi H, Haghdoost A, Arjomand M, Sarbazi-Azad H (2016) A hybrid non-volatile cache design for solid-state drives using comprehensive I\/O characterization. IEEE Trans Comput 65(6):1678\u20131691. https:\/\/doi.org\/10.1109\/TC.2015.2455978","journal-title":"IEEE Trans Comput"},{"unstructured":"Megiddo N, Modha DS (2003) ARC: a self-tuning, low overhead replacement cache. In: Proceedings of the 2nd USENIX Conference on File and Storage Technologies, USENIX Association, Berkeley, CA, USA, FAST \u201903, pp 115\u2013130. http:\/\/dl.acm.org\/citation.cfm?id=1090694.1090708","key":"2311_CR19"},{"issue":"4","key":"2311_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2004.1297303","volume":"37","author":"N Megiddo","year":"2004","unstructured":"Megiddo N, Modha DS (2004) Outperforming LRU with an adaptive replacement cache algorithm. Computer 37(4):58\u201365. https:\/\/doi.org\/10.1109\/MC.2004.1297303","journal-title":"Computer"},{"issue":"3","key":"2311_CR21","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/1416944.1416949","volume":"4","author":"D Narayanan","year":"2008","unstructured":"Narayanan D, Donnelly A, Rowstron A (2008) Write off-loading: practical power management for enterprise storage. Trans Storage 4(3):10:1\u201310:23. https:\/\/doi.org\/10.1145\/1416944.1416949","journal-title":"Trans Storage"},{"issue":"2","key":"2311_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/170036.170081","volume":"22","author":"EJ O\u2019Neil","year":"1993","unstructured":"O\u2019Neil EJ, O\u2019Neil PE, Weikum G (1993) The LRU-K page replacement algorithm for database disk buffering. SIGMOD Rec 22(2):297\u2013306. https:\/\/doi.org\/10.1145\/170036.170081","journal-title":"SIGMOD Rec"},{"unstructured":"Schlosser M, Condie T, Kamvar S (2003) Simulating a file-sharing P2P network. Technical Report 2003-28, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/589\/","key":"2311_CR23"},{"doi-asserted-by":"crossref","unstructured":"Storage Networking Industry Association (SNIA) (2007) IOTTA repository. http:\/\/iotta.snia.org\/traces\/388 . Accessed 2 April 2017","key":"2311_CR24","DOI":"10.1016\/S1351-4210(07)70189-0"},{"doi-asserted-by":"publisher","unstructured":"Tracey D, Sreenan C (2016) CacheL\u2014a cache algorithm using leases for node data in the internet of things. In: Proceedings of the 4th IEEE International Conference on Future Internet of Things and Cloud, IEEE Press, Vienna, Austria, FiCloud \u201916, pp 1\u20138. https:\/\/doi.org\/10.1109\/FiCloud.2016.9","key":"2311_CR25","DOI":"10.1109\/FiCloud.2016.9"},{"doi-asserted-by":"publisher","unstructured":"Tsai HB, Lei CL (2017) A page replacement algorithm based on frequency derived from reference history. In: Proceedings of the 32st Annual ACM Symposium on Applied Computing, ACM, New York, NY, USA, SAC \u201917, pp 1522\u20131527. https:\/\/doi.org\/10.1145\/3019612.3019737","key":"2311_CR26","DOI":"10.1145\/3019612.3019737"},{"unstructured":"Zhou Y, Philbin J, Li K (2001) The multi-queue replacement algorithm for second level buffer caches. In: Proceedings of the General Track: 2001 USENIX Annual Technical Conference, USENIX Association, Berkeley, CA, USA, pp 91\u2013104. http:\/\/dl.acm.org\/citation.cfm?id=647055.715773","key":"2311_CR27"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2311-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2311-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2311-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:33:15Z","timestamp":1719891195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2311-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,19]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2311"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2311-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,3,19]]},"assertion":[{"value":"19 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}