{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:41:35Z","timestamp":1773758495521,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) Grant through the Korean Government [Ministry of Science and Information and Communication Technologies (ICT) (MSIT)]","doi-asserted-by":"publisher","award":["2020R1F1A1048485"],"award-info":[{"award-number":["2020R1F1A1048485"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002559","name":"Sookmyung Women\u2019s University Research","doi-asserted-by":"publisher","award":["1-2203-2011"],"award-info":[{"award-number":["1-2203-2011"]}],"id":[{"id":"10.13039\/501100002559","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3180327","type":"journal-article","created":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:13:27Z","timestamp":1654546407000},"page":"59792-59805","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Stack Distance Approximation Based on Workload Characteristics"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1166-0584","authenticated-orcid":false,"given":"Sooyoung","family":"Lim","sequence":"first","affiliation":[{"name":"Department of Software, Sookmyung Women’s University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6553-7448","authenticated-orcid":false,"given":"Dongchul","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Software, Sookmyung Women’s University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/773146.773043"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380176"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3084851"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"ref5","first-page":"741","article-title":"Efficient miss ratio curve computation for heterogeneous content popularity","volume-title":"Proc. USENIX ATC","author":"Carra"},{"key":"ref6","article-title":"A survey of miss-ratio curve construction techniques","author":"Byrne","year":"2018","journal-title":"arXiv:1804.01972"},{"key":"ref7","first-page":"95","article-title":"Efficient MRC construction with SHARDS","volume-title":"Proc. USENIX FAST","author":"Waldspurger"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/107971.107995"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.117"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3210563.3210571"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2004.1291352"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375648"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1190215.1190227"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2010.5452069"},{"key":"ref17","article-title":"The performance analysis of big data processing platforms using next-generation large-capacity persistent memory","author":"Oh","year":"2022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1902-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3120660"},{"key":"ref20","volume-title":"OLTP Application I\/O","year":"2022"},{"key":"ref21","volume-title":"Search Engine I\/O","year":"2022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937216"},{"key":"ref23","volume-title":"DiskMon for Windows v2.01","author":"Russinovich","year":"2006"},{"key":"ref24","volume-title":"MSR Cambridge Traces (SNIA IOTTA) Trace Set)","author":"Narayana","year":"2007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782836"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.006"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848145"},{"key":"ref28","first-page":"351","article-title":"Kinetic modeling of data eviction in cache","volume-title":"Proc. USENIX ATC","author":"Hu"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2671007"},{"key":"ref30","first-page":"487","article-title":"Cache modeling and optimization using miniature simulations","volume-title":"Proc. USENIX ATC","author":"Waldspurger"},{"key":"ref31","first-page":"221","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI55740.2022.00017"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09789168.pdf?arnumber=9789168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:35:52Z","timestamp":1706754952000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9789168\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3180327","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}