{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:49:20Z","timestamp":1777344560482,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811680618","type":"print"},{"value":"9789811680625","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-8062-5_10","type":"book-chapter","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T20:02:53Z","timestamp":1636833773000},"page":"161-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Prediction-Based Cache Replacement Policy for Flash Storage"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6523-6047","authenticated-orcid":false,"given":"Van-Nguyen","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4568-3557","authenticated-orcid":false,"given":"Mwasinga Lusungu","family":"Josh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5286-6629","authenticated-orcid":false,"given":"Duc-Tai","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4206-3718","authenticated-orcid":false,"given":"Sang-Won","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6485-3155","authenticated-orcid":false,"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,14]]},"reference":[{"key":"10_CR1","unstructured":"Umass trace repository. [online] available: http:\/\/traces.cs.umass.edu\/index.php\/storage\/storage"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Syst. J. 5(2), 78\u2013101 (1966). https:\/\/doi.org\/10.1147\/sj.52.0078","journal-title":"IBM Syst. J."},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/JPROC.2003.811702","volume":"91","author":"R Bez","year":"2003","unstructured":"Bez, R., Camerlenghi, E., Modelli, A., Visconti, A.: Introduction to flash memory. Proc. IEEE 91(4), 489\u2013502 (2003). https:\/\/doi.org\/10.1109\/JPROC.2003.811702","journal-title":"Proc. IEEE"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s12652-018-1109-4","volume":"11","author":"W Chao","year":"2018","unstructured":"Chao, W.: Web cache intelligent replacement strategy combined with GDSF and SVM network re-accessed probability prediction. J. Ambient. Intell. Humaniz. Comput. 11(2), 581\u2013587 (2018). https:\/\/doi.org\/10.1007\/s12652-018-1109-4","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, S., Kumari, P., Ray, B., Chakraborty, R.S.: Machine learning assisted accurate estimation of usage duration and manufacturer for recycled and counterfeit flash memory detection. In: 2019 IEEE 28th Asian Test Symposium (ATS), pp. 49\u2013495 (2019). https:\/\/doi.org\/10.1109\/ATS47505.2019.000-1","DOI":"10.1109\/ATS47505.2019.000-1"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Huang, S., Wei, Q., Feng, D., Chen, J., Chen, C.: Improving flash-based disk cache with lazy adaptive replacement. ACM Trans. Storage 12(2) (2016). https:\/\/doi.org\/10.1145\/2737832","DOI":"10.1145\/2737832"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Liu, C., et al.: LCR: load-aware cache replacement algorithm for flash-based SSDs. In: 2018 IEEE International Conference on Networking, Architecture and Storage (NAS), pp. 1\u201310 (2018). https:\/\/doi.org\/10.1109\/NAS.2018.8515727","DOI":"10.1109\/NAS.2018.8515727"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Nimishan, S., Shriparen, S.: An approach to improve the performance of web proxy cache replacement using machine learning techniques. In: 2018 IEEE International Conference on Information and Automation for Sustainability (ICIAfS), pp. 1\u20136 (2018). https:\/\/doi.org\/10.1109\/ICIAFS.2018.8913368","DOI":"10.1109\/ICIAFS.2018.8913368"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Park, S.Y., Jung, D., Kang, J.U., Kim, J.S., Lee, J.: CFLRU: a replacement algorithm for flash memory. In: CASES 2006: International Conference on Compilers, Architecture and Synthesis for Embedded Systems. Association for Computing Machinery, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1176760.1176789","DOI":"10.1145\/1176760.1176789"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian, N.: On the momentum term in gradient descent learning algorithms. Neural Netw. 12(1), 145\u2013151 (1999)","journal-title":"Neural Netw."},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Sethumurugan, S., Yin, J., Sartori, J.: Designing a cost-effective cache replacement policy using machine learning. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 291\u2013303 (2021). https:\/\/doi.org\/10.1109\/HPCA51647.2021.00033","DOI":"10.1109\/HPCA51647.2021.00033"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Wang, F., Wang, F., Liu, J., Shea, R., Sun, L.: Intelligent video caching at network edge: a multi-agent deep reinforcement learning approach. In: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, pp. 2499\u20132508 (2020). https:\/\/doi.org\/10.1109\/INFOCOM41043.2020.9155373","DOI":"10.1109\/INFOCOM41043.2020.9155373"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Wang, H., Yi, X., Huang, P., Cheng, B., Zhou, K.: Efficient SSD caching by avoiding unnecessary writes using machine learning. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3225058.3225126","DOI":"10.1145\/3225058.3225126"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"58073","DOI":"10.1109\/ACCESS.2019.2913961","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yang, Y., Han, C., Ye, L., Ke, Y., Wang, Q.: LR-LRU: A PACS-oriented intelligent cache replacement policy. IEEE Access 7, 58073\u201358084 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2913961","journal-title":"IEEE Access"},{"key":"10_CR15","unstructured":"Wright, R.E.: Logistic regression (1995)"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"250","DOI":"10.18178\/ijmlc.2021.11.3.1043","volume":"10","author":"YY Yinyin Wang","year":"2021","unstructured":"Yinyin Wang, Y.Y., Wang, Q.: An efficient intelligent cache replacement policy suitable for PACS. Int. J. Mach. Learn. Comput. 10(3), 250\u2013255 (2021)","journal-title":"Int. J. Mach. Learn. Comput."}],"container-title":["Communications in Computer and Information Science","Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-8062-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T20:12:25Z","timestamp":1636834345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-8062-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811680618","9789811680625"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-8062-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/thefdse.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"168","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":"52","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":"8","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":"31% - 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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}