完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Wen-Hueien_US
dc.contributor.authorChang, Li-Pinen_US
dc.date.accessioned2018-08-21T05:56:55Z-
dc.date.available2018-08-21T05:56:55Z-
dc.date.issued2012-01-01en_US
dc.identifier.issn1530-1591en_US
dc.identifier.urihttp://hdl.handle.net/11536/146836-
dc.description.abstractIn the recent years, commodity solid-state disks have started adopting powerful controllers and implemented page-level mapping for flash management. However, many of these models still use primitive garbage-collection algorithms, because prior approaches do not scale up with the dramatic increase of flash capacity. This study introduces Dual Greedy for garbage collection in page-level mapping. Dual Greedy identifies page-accurate data hotness using only block-level information, and adaptively switches its preference of victim selection between block space utilization and block stability. It can run in constant time and use very limited RAM space. Our experimental results show that Dual Greedy outperforms existing approaches in terms of garbage-collection overhead, especially with large flash blocks.en_US
dc.language.isoen_USen_US
dc.titleDual Greedy: Adaptive Garbage Collection for Page-Mapping Solid-State Disksen_US
dc.typeProceedings Paperen_US
dc.identifier.journalDESIGN, AUTOMATION & TEST IN EUROPE (DATE 2012)en_US
dc.citation.spage117en_US
dc.citation.epage122en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000415126300021en_US
顯示於類別:會議論文