{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:21:04Z","timestamp":1761402064244,"version":"3.41.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T00:00:00Z","timestamp":1590537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1553579"],"award-info":[{"award-number":["1553579"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2020,5,27]]},"abstract":"<jats:p>New memory technologies are blurring the previously distinctive performance characteristics of adjacent layers in the memory hierarchy. No longer are such layers orders of magnitude different in request latency or capacity. Beyond the traditional single-layer view of caching, we now must re-cast the problem as a data placement challenge: which data should be cached in faster memory if it could instead be served directly from slower memory? We present CHOPT, an offline algorithm for data placement across multiple tiers of memory with asymmetric read and write costs. We show that CHOPT is optimal and can therefore serve as the upper bound of performance gain for any data placement algorithm. We also demonstrate an approximation of CHOPT which makes its execution time for long traces practical using spatial sampling of requests incurring a small 0.2% average error on representative workloads at a sampling ratio of 1%. Our evaluation of CHOPT on more than 30 production traces and benchmarks shows that optimal data placement decisions could improve average request latency by 8.2%-44.8% when compared with the long-established gold standard: Belady and Mattson's offline, evict-farthest-in-the-future optimal algorithms. Our results identify substantial improvement opportunities for future online memory management research.<\/jats:p>","DOI":"10.1145\/3379472","type":"journal-article","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T04:29:21Z","timestamp":1590640161000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems"],"prefix":"10.1145","volume":"4","author":[{"given":"Lei","family":"Zhang","sequence":"first","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Karimi","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irfan","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Magnition, Redwood City, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ymir","family":"Vigfusson","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037706"},{"key":"e_1_2_1_2_1","volume-title":"SODA","volume":"99","author":"Albers Susanne","year":"1999","unstructured":"Susanne Albers , Sanjeev Arora , and Sanjeev Khanna . 1999 . Page replacement for general caching problems . In SODA , Vol. 99 . Citeseer, 31--40. Susanne Albers, Sanjeev Arora, and Sanjeev Khanna. 1999. Page replacement for general caching problems. In SODA, Vol. 99. Citeseer, 31--40."},{"key":"e_1_2_1_3_1","unstructured":"Qasim Ali and Praveen Yedlapalli. 2019. Persistent Memory Performance in vSphere 6.7. (2019).  Qasim Ali and Praveen Yedlapalli. 2019. Persistent Memory Performance in vSphere 6.7. (2019)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2019.2899330"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_2_1_6_1","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Beckmann Nathan","year":"2018","unstructured":"Nathan Beckmann , Haoxian Chen , and Asaf Cidon . 2018 . LHD: Improving Cache Hit Rate by Maximizing Hit Density . In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18) . 389--403. Nathan Beckmann, Haoxian Chen, and Asaf Cidon. 2018. LHD: Improving Cache Hit Rate by Maximizing Hit Density. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18). 389--403."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056022"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.43"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_2_1_10_1","unstructured":"Daniel S Berger. 2018a. Design and Analysis of Adaptive Caching Techniques for Internet Content Delivery. (2018).  Daniel S Berger. 2018a. Design and Analysis of Adaptive Caching Techniques for Internet Content Delivery. (2018)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Daniel S Berger. 2018b. Towards Lightweight and Robust Machine Learning for CDN Caching.. In HotNets . 134--140.  Daniel S Berger. 2018b. Towards Lightweight and Robust Machine Learning for CDN Caching.. In HotNets . 134--140.","DOI":"10.1145\/3286062.3286082"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3224427"},{"key":"e_1_2_1_13_1","volume-title":"14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)","author":"Berger Daniel S","year":"2017","unstructured":"Daniel S Berger , Ramesh K Sitaraman , and Mor Harchol-Balter . 2017 . AdaptSize: Orchestrating the hot object memory cache in a content delivery network . In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17) . 483--498. Daniel S Berger, Ramesh K Sitaraman, and Mor Harchol-Balter. 2017. AdaptSize: Orchestrating the hot object memory cache in a content delivery network. In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17) . 483--498."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210563.3210571"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54029-6_157"},{"key":"e_1_2_1_17_1","volume-title":"USENIX Annual Technical Conference (ATC 16)","author":"Cheng Yue","year":"2016","unstructured":"Yue Cheng , Fred Douglis , Philip Shilane , Grant Wallace , Peter Desnoyers , and Kai Li . 2016 . Erasing Belady's limitations: In search of flash cache offline optimality . In USENIX Annual Technical Conference (ATC 16) . 379--392. Yue Cheng, Fred Douglis, Philip Shilane, Grant Wallace, Peter Desnoyers, and Kai Li. 2016. Erasing Belady's limitations: In search of flash cache offline optimality. In USENIX Annual Technical Conference (ATC 16). 379--392."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669157"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274808.3274816"},{"key":"e_1_2_1_20_1","first-page":"35","article-title":"TinyLFU: A highly efficient cache admission policy","volume":"13","author":"Einziger Gil","year":"2017","unstructured":"Gil Einziger , Roy Friedman , and Ben Manes . 2017 . TinyLFU: A highly efficient cache admission policy . ACM Transactions on Storage (ToS) , Vol. 13 , 4 (2017), 35 . Gil Einziger, Roy Friedman, and Ben Manes. 2017. TinyLFU: A highly efficient cache admission policy. ACM Transactions on Storage (ToS) , Vol. 13, 4 (2017), 35.","journal-title":"ACM Transactions on Storage (ToS)"},{"key":"e_1_2_1_21_1","unstructured":"Assaf Eisenman Asaf Cidon Evgenya Pergament Or Haimovich Ryan Stutsman Mohammad Alizadeh and Sachin Katti. 2019. Flashield: a Hybrid Key-value Cache that Controls Flash Write Amplification.. In NSDI . 65--78.  Assaf Eisenman Asaf Cidon Evgenya Pergament Or Haimovich Ryan Stutsman Mohammad Alizadeh and Sachin Katti. 2019. Flashield: a Hybrid Key-value Cache that Controls Flash Write Amplification.. In NSDI . 65--78."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190524"},{"key":"e_1_2_1_23_1","volume-title":"Bandana: Using non-volatile memory for storing deep learning models. arXiv preprint arXiv:1811.05922","author":"Eisenman Assaf","year":"2018","unstructured":"Assaf Eisenman , Maxim Naumov , Darryl Gardner , Misha Smelyanskiy , Sergey Pupyrev , Kim Hazelwood , Asaf Cidon , and Sachin Katti . 2018 b. Bandana: Using non-volatile memory for storing deep learning models. arXiv preprint arXiv:1811.05922 (2018). Assaf Eisenman, Maxim Naumov, Darryl Gardner, Misha Smelyanskiy, Sergey Pupyrev, Kim Hazelwood, Asaf Cidon, and Sachin Katti. 2018b. Bandana: Using non-volatile memory for storing deep learning models. arXiv preprint arXiv:1811.05922 (2018)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1095"},{"key":"e_1_2_1_25_1","volume-title":"http:\/\/memcached.org Retrieved","author":"Fitzpatrick Brad","year":"2019","unstructured":"Brad Fitzpatrick . 2009. Memcached . http:\/\/memcached.org Retrieved Aug 7 2019 from Brad Fitzpatrick. 2009. Memcached . http:\/\/memcached.org Retrieved Aug 7 2019 from"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000064.2000075"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4.","author":"Gill Binny S","year":"2008","unstructured":"Binny S Gill . 2008 . On multi-level exclusive caching: offline optimality and why promotions are better than demotions . In Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4. Binny S Gill. 2008. On multi-level exclusive caching: offline optimality and why promotions are better than demotions. In Proceedings of the 6th USENIX Conference on File and Storage Technologies. USENIX Association, 4."},{"key":"e_1_2_1_28_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Gog Ionel","year":"2016","unstructured":"Ionel Gog , Malte Schwarzkopf , Adam Gleave , Robert NM Watson , and Steven Hand . 2016 . Firmament: fast, centralized cluster scheduling at scale . In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16) . 99--115. Ionel Gog, Malte Schwarzkopf, Adam Gleave, Robert NM Watson, and Steven Hand. 2016. Firmament: fast, centralized cluster scheduling at scale. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). 99--115."},{"key":"e_1_2_1_29_1","volume-title":"2016 USENIX Annual Technical Conference (ATC 16)","author":"Hu Xiameng","year":"2016","unstructured":"Xiameng Hu , Xiaolin Wang , Lan Zhou , Yingwei Luo , Chen Ding , and Zhenlin Wang . 2016 . Kinetic modeling of data eviction in cache . In 2016 USENIX Annual Technical Conference (ATC 16) . 351--364. Xiameng Hu, Xiaolin Wang, Lan Zhou, Yingwei Luo, Chen Ding, and Zhenlin Wang. 2016. Kinetic modeling of data eviction in cache. In 2016 USENIX Annual Technical Conference (ATC 16) . 351--364."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522722"},{"key":"e_1_2_1_31_1","volume-title":"Zixuan Wang, Yi Xu, Subramanya R Dulloor, et almbox.","author":"Izraelevitz Joseph","year":"2019","unstructured":"Joseph Izraelevitz , Jian Yang , Lu Zhang , Juno Kim , Xiao Liu , Amirsaman Memaripour , Yun Joon Soh , Zixuan Wang, Yi Xu, Subramanya R Dulloor, et almbox. 2019 . Basic performance measurements of the Intel Optane DC persistent memory module. arXiv preprint arXiv:1903.05714 (2019). Joseph Izraelevitz, Jian Yang, Lu Zhang, Juno Kim, Xiao Liu, Amirsaman Memaripour, Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R Dulloor, et almbox. 2019. Basic performance measurements of the Intel Optane DC persistent memory module. arXiv preprint arXiv:1903.05714 (2019)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.17"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00020"},{"key":"e_1_2_1_34_1","volume-title":"2017 ACM\/IEEE 44th Annual International Symposium on Computer Architecture (ISCA). IEEE, 521--534","author":"Kannan Sudarsun","year":"2017","unstructured":"Sudarsun Kannan , Ada Gavrilovska , Vishal Gupta , and Karsten Schwan . 2017 . HeteroOS -- OS design for heterogeneous memory management in datacenter . In 2017 ACM\/IEEE 44th Annual International Symposium on Computer Architecture (ISCA). IEEE, 521--534 . Sudarsun Kannan, Ada Gavrilovska, Vishal Gupta, and Karsten Schwan. 2017. HeteroOS -- OS design for heterogeneous memory management in datacenter. In 2017 ACM\/IEEE 44th Annual International Symposium on Computer Architecture (ISCA). IEEE, 521--534."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.286300"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00035"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323300"},{"key":"e_1_2_1_38_1","volume-title":"Beating OPT with Statistical Clairvoyance and Variable Size Caching. In 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 19)","author":"Li Pengcheng","year":"2019","unstructured":"Pengcheng Li , Colin Pronovost , William Wilson , Benjamin Tait , Jie Zhou , Chen Ding , and John Criswell . 2019 . Beating OPT with Statistical Clairvoyance and Variable Size Caching. In 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 19) . ACM, 243--256. Pengcheng Li, Colin Pronovost, William Wilson, Benjamin Tait, Jie Zhou, Chen Ding, and John Criswell. 2019. Beating OPT with Statistical Clairvoyance and Variable Size Caching. In 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 19). ACM, 243--256."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2017.130"},{"key":"e_1_2_1_40_1","volume-title":"Vijay Janapa Reddi, and Kim Hazelwood","author":"Luk Chi-Keung","year":"2005","unstructured":"Chi-Keung Luk , Robert Cohn , Robert Muth , Harish Patil , Artur Klauser , Geoff Lowney , Steven Wallace , Vijay Janapa Reddi, and Kim Hazelwood . 2005 . Pin: building customized program analysis tools with dynamic instrumentation. In ACM SIGPLAN Notices, Vol. 40 . ACM , 190--200. Chi-Keung Luk, Robert Cohn, Robert Muth, Harish Patil, Artur Klauser, Geoff Lowney, Steven Wallace, Vijay Janapa Reddi, and Kim Hazelwood. 2005. Pin: building customized program analysis tools with dynamic instrumentation. In ACM SIGPLAN Notices, Vol. 40. ACM, 190--200."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2819001.2819005"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_2_1_43_1","first-page":"115","article-title":"ARC: A Self-Tuning, Low Overhead Replacement Cache","volume":"3","author":"Megiddo Nimrod","year":"2003","unstructured":"Nimrod Megiddo and Dharmendra S Modha . 2003 . ARC: A Self-Tuning, Low Overhead Replacement Cache .. In FAST , Vol. 3. 115 -- 130 . Nimrod Megiddo and Dharmendra S Modha. 2003. ARC: A Self-Tuning, Low Overhead Replacement Cache.. In FAST, Vol. 3. 115--130.","journal-title":"FAST"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3017992"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.3390\/jlpea6020005"},{"key":"e_1_2_1_46_1","first-page":"45","article-title":"Introducing the Graph 500","volume":"19","author":"Murphy Richard C","year":"2010","unstructured":"Richard C Murphy , Kyle B Wheeler , Brian W Barrett , and James A Ang . 2010 . Introducing the Graph 500 . Cray Users Group (CUG) , Vol. 19 (2010), 45 -- 74 . Richard C Murphy, Kyle B Wheeler, Brian W Barrett, and James A Ang. 2010. Introducing the Graph 500 . Cray Users Group (CUG) , Vol. 19 (2010), 45--74.","journal-title":"Cray Users Group (CUG)"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2018.00025"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2017.81"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2010.5416645"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273440.1250709"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.49"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.053013.120733"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/844128.844158"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358319"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2018.2886443"},{"key":"e_1_2_1_56_1","volume-title":"USENIX Annual Technical Conference (ATC 17)","author":"Waldspurger Carl","year":"2017","unstructured":"Carl Waldspurger , Trausti Saemundsson , Irfan Ahmad , and Nohhyun Park . 2017 . Cache modeling and optimization using miniature simulations . In USENIX Annual Technical Conference (ATC 17) . 487--498. Carl Waldspurger, Trausti Saemundsson, Irfan Ahmad, and Nohhyun Park. 2017. Cache modeling and optimization using miniature simulations. In USENIX Annual Technical Conference (ATC 17). 487--498."},{"key":"e_1_2_1_57_1","volume-title":"Efficient MRC Construction with SHARDS. In 13th USENIX Conference on File and Storage Technologies (FAST 15)","author":"Waldspurger Carl A","year":"2015","unstructured":"Carl A Waldspurger , Nohhyun Park , Alexander Garthwaite , and Irfan Ahmad . 2015 . Efficient MRC Construction with SHARDS. In 13th USENIX Conference on File and Storage Technologies (FAST 15) . 95--110. Carl A Waldspurger, Nohhyun Park, Alexander Garthwaite, and Irfan Ahmad. 2015. Efficient MRC Construction with SHARDS. In 13th USENIX Conference on File and Storage Technologies (FAST 15). 95--110."},{"key":"e_1_2_1_58_1","first-page":"51","article-title":"WADE: Writeback-aware dynamic cache management for NVM-based main memory system","volume":"10","author":"Wang Zhe","year":"2013","unstructured":"Zhe Wang , Shuchang Shan , Ting Cao , Junli Gu , Yi Xu , Shuai Mu , Yuan Xie , and Daniel A Jim\u00e9nez . 2013 . WADE: Writeback-aware dynamic cache management for NVM-based main memory system . ACM Transactions on Architecture and Code Optimization (TACO) , Vol. 10 , 4 (2013), 51 . Zhe Wang, Shuchang Shan, Ting Cao, Junli Gu, Yi Xu, Shuai Mu, Yuan Xie, and Daniel A Jim\u00e9nez. 2013. WADE: Writeback-aware dynamic cache management for NVM-based main memory system. ACM Transactions on Architecture and Code Optimization (TACO) , Vol. 10, 4 (2013), 51.","journal-title":"ACM Transactions on Architecture and Code Optimization (TACO)"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/2786397.2786398"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685075"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/647057.713858"},{"key":"e_1_2_1_62_1","unstructured":"Fengguang Wu. 2018. PMEM NUMA node and hotness accounting\/migration . In Linux Kernel Mailing List Archive. https:\/\/lkml.org\/lkml\/2018\/12\/26\/138 Last accessed on 08-08--2019.  Fengguang Wu. 2018. PMEM NUMA node and hotness accounting\/migration . In Linux Kernel Mailing List Archive. https:\/\/lkml.org\/lkml\/2018\/12\/26\/138 Last accessed on 08-08--2019."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522326"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496988"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00043"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379472","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3379472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:22Z","timestamp":1750197742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,27]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5,27]]}},"alternative-id":["10.1145\/3379472"],"URL":"https:\/\/doi.org\/10.1145\/3379472","relation":{},"ISSN":["2476-1249"],"issn-type":[{"type":"electronic","value":"2476-1249"}],"subject":[],"published":{"date-parts":[[2020,5,27]]},"assertion":[{"value":"2020-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}