{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:47:18Z","timestamp":1771955238490,"version":"3.50.1"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T00:00:00Z","timestamp":1442361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2015,9,16]]},"abstract":"<jats:p>Solid state drives have been widely applied in modern computer systems. The lifetime of the SSD depends heavily on the efficiency of the implementation of the garbage collection (GC) algorithm that reclaims previously used pages. In this paper, we present the first detailed proof that the greedy GC algorithm has the optimal performance (minimized write amplification) for memoryless workloads.<\/jats:p>","DOI":"10.1145\/2825236.2825261","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T12:31:00Z","timestamp":1442925060000},"page":"63-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["On the Optimality of Greedy Garbage Collection for SSDs"],"prefix":"10.1145","volume":"43","author":[{"given":"Yudong","family":"Yang","sequence":"first","affiliation":[{"name":"Columbia University"}]},{"given":"Vishal","family":"Misra","sequence":"additional","affiliation":[{"name":"Columbia University"}]},{"given":"Dan","family":"Rubenstein","sequence":"additional","affiliation":[{"name":"Columbia University"}]}],"member":"320","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.07.003"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492101.1555371"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2367589.2367603"},{"key":"e_1_2_1_4_1","first-page":"31","article-title":"The fundamental limit of flash random write performance: Understanding, analysis and performance modelling. Technical report","volume":"2010","author":"Haas X.","year":"2010","unstructured":"X. Haas and X. Hu . The fundamental limit of flash random write performance: Understanding, analysis and performance modelling. Technical report , IBM Research Report , 2010\/3 \/ 31 , 2010 . X. Haas and X. Hu. The fundamental limit of flash random write performance: Understanding, analysis and performance modelling. Technical report, IBM Research Report, 2010\/3\/31, 2010.","journal-title":"IBM Research Report"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1534530.1534544"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465546"},{"key":"e_1_2_1_7_1","first-page":"117","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE), 2012","author":"Lin W.-H.","year":"2012","unstructured":"W.-H. Lin and L.-P. Chang . Dual greedy : Adaptive garbage collection for page-mapping solid-state disks. In Design , Automation & Test in Europe Conference & Exhibition (DATE), 2012 , pages 117 -- 122 . IEEE, 2012 . W.-H. Lin and L.-P. Chang. Dual greedy: Adaptive garbage collection for page-mapping solid-state disks. In Design, Automation & Test in Europe Conference & Exhibition (DATE), 2012, pages 117--122. IEEE, 2012."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494232.2465543"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.08.010"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2825236.2825261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2825236.2825261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:23Z","timestamp":1750225403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2825236.2825261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,16]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9,16]]}},"alternative-id":["10.1145\/2825236.2825261"],"URL":"https:\/\/doi.org\/10.1145\/2825236.2825261","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9,16]]},"assertion":[{"value":"2015-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}