Using generational garbage collection to implement cache-conscious data placement

1999 ◽  
Vol 34 (3) ◽  
pp. 37-48 ◽  
Author(s):  
Trishul M. Chilimbi ◽  
James R. Larus
2021 ◽  
Vol 11 (24) ◽  
pp. 11842
Author(s):  
Gijun Oh ◽  
Junseok Yang ◽  
Sungyong Ahn

Log-structured merge-tree (LSM-Tree)-based key–value stores are attracting attention for their high I/O (Input/Output) performance due to their sequential write characteristics. However, excessive writes caused by compaction shorten the lifespan of the Solid-state Drive (SSD). Therefore, there are several studies aimed at reducing garbage collection overhead by using Zoned Namespace ZNS; SSD in which the host can determine data placement. However, the existing studies have limitations in terms of performance improvement because the lifetime and hotness of key–value data are not considered. Therefore, in this paper, we propose a technique to minimize the space efficiency and garbage collection overhead of SSDs by arranging them according to the characteristics of key–value data. The proposed method was implemented by modifying ZenFS of RocksDB and, according to the result of the performance evaluation, the space efficiency could be improved by up to 75%.


1977 ◽  
Vol 12 (6) ◽  
pp. 42-48
Author(s):  
Péter Szöke
Keyword(s):  

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
M. Maghsoudloo ◽  
A. Rahdari ◽  
N. Khoshavi

Author(s):  
Dokeun Lee ◽  
Youjip Won ◽  
Yongjun Park ◽  
Seongjin Lee
Keyword(s):  

1999 ◽  
Vol 34 (5) ◽  
pp. 118-127
Author(s):  
James M. Stichnoth ◽  
Guei-Yuan Lueh ◽  
Michał Cierniak
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document