{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T18:46:27Z","timestamp":1769021187325,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031329098","type":"print"},{"value":"9783031329104","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32910-4_17","type":"book-chapter","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T05:38:34Z","timestamp":1683783514000},"page":"239-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LOACR: A Cache Replacement Method Based on\u00a0Loop Assist"],"prefix":"10.1007","author":[{"given":"Tian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinjie","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyu","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fulin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangbin","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,11]]},"reference":[{"key":"17_CR1","unstructured":"Association, S.N.I., et al.: The snia\u2019s i\/o traces, tools, and analysis (iotta) repository (2021)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"25922","DOI":"10.1109\/ACCESS.2022.3156692","volume":"10","author":"H Choi","year":"2022","unstructured":"Choi, H., Park, S.: Learning future reference patterns for efficient cache replacement decisions. IEEE Access 10, 25922\u201325934 (2022)","journal-title":"IEEE Access"},{"key":"17_CR3","unstructured":"Choi, J., Noh, S.H., Sang, L.M., Cho, Y.: An adaptive block management scheme using on-line detection of block reference patterns. In: International Workshop on Multi-media Database Management Systems (1998)"},{"key":"17_CR4","unstructured":"Choi, J., Noh, S.H., Min, S.L., Cho, Y.: An implementation study of a detection-based adaptive block replacement scheme. In: USENIX Annual Technical Conference, General Track, pp. 239\u2013252 (1999)"},{"key":"17_CR5","unstructured":"Cidon, A., Eisenman, A., Katti, S., Attar, M.A.: Cliffhanger: Scaling performance cliffs in web memory caches. In: Networked Systems Design and Implementation (2016)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2737832","volume":"12","author":"S Huang","year":"2016","unstructured":"Huang, S., Wei, Q., Feng, D., Chen, J., Chen, C.: Improving flash-based disk cache with lazy adaptive replacement. ACM Trans. Storage (TOS) 12(2), 1\u201324 (2016)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"17_CR7","unstructured":"Kim, J.M., et al.: A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references. In: Proceedings of the 4th Conference on Symposium on Operating System Design & Implementation-Volume 4 (2000)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Li, C.: Dlirs: Improving low inter-reference recency set cache replacement policy with dynamics. In: Proceedings of the 11th ACM International Systems and Storage Conference, pp. 59\u201364 (2018)","DOI":"10.1145\/3211890.3211891"},{"key":"17_CR9","unstructured":"Li, P., Gu, Y.: Learning forward reuse distance (2020)"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput. 108(2), 212\u2013261 (1994)","journal-title":"Inf. Comput."},{"issue":"368","key":"17_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.2307\/2232669","volume":"92","author":"G Loomes","year":"1982","unstructured":"Loomes, G., Sugden, R.: Regret theory: an alternative theory of rational choice under uncertainty. Econ. J. 92(368), 805\u2013824 (1982)","journal-title":"Econ. J."},{"key":"17_CR12","unstructured":"Manes, B.: Caffeine: A high performance caching library for java 8. https:\/\/github.com\/ben-manes\/caffeine (2016)"},{"key":"17_CR13","unstructured":"Megiddo, N.: Arc : A self-tuning, low overhead replacement cache. In: USENIX File and Storaqe Technologies Conference (FAST\u201903), San Francisco, CA (2003)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Robinson, J.T., Devarakonda, M.V.: Data cache management using frequency-based replacement. In: Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 134\u2013142 (1990)","DOI":"10.1145\/98460.98523"},{"key":"17_CR15","unstructured":"Rodriguez, L.V., et al.: Learning cache replacement with cacheus. In: File and Storage Technologies (2021)"},{"key":"17_CR16","unstructured":"Santana, R., Lyons, S., Koller, R., Rangaswami, R., Liu, J.: To arc or not to arc. In: Proceedings of the 7th USENIX Conference on Hot Topics in Storage and File Systems, pp. 14\u201314 (2015)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Shi, Z., Huang, X., Jain, A., Lin, C.: Applying deep learning to the cache replacement problem. In: Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 413\u2013425 (2019)","DOI":"10.1145\/3352460.3358319"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Smith, W.L.: Regenerative stochastic processes. Proc. Royal Society of London. Series A. Math. Phys. Sci. 232(1188), 6\u201331 (1955)","DOI":"10.1098\/rspa.1955.0198"},{"key":"17_CR19","unstructured":"Song, J., Zhang, X.: Lirs: An efficient low inter-reference recency set replacement to improve buffer cache performance. In: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2002, June 15\u201319, 2002, Marina Del Rey, California, USA (2002)"},{"key":"17_CR20","unstructured":"Vietri, G., et al.: Driving cache replacement with ml-based lecar. In: USENIX Annual Technical Conference (2018)"},{"key":"17_CR21","unstructured":"Waldspurger, C.A., Saemundsson, T., Ahmad, I., Park, N.: Cache modeling and optimization using miniature simulations. In: USENIX Annual Technical Conference, pp. 487\u2013498 (2017)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Wulf, W.A., Mckee, S.A.: Hitting the memory wall: Implications of the obvious. Acm Sigarch Computer Architecture News (1995)","DOI":"10.1145\/216585.216588"}],"container-title":["Lecture Notes in Computer Science","Spatial Data and Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32910-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T05:41:51Z","timestamp":1683783711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32910-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031329098","9783031329104"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32910-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpatialDI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Spatial Data and Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spatialdi2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}