NVKVS: Non-Volatile Memory Optimized Key-Value Separated LSM-Tree

• Item type: Journal(1)
• 公開日: 2022-05-15
• タイトル: NVKVS: Non-Volatile Memory Optimized Key-Value Separated LSM-Tree
• タイトル / 言語: en
• タイトル: NVKVS: Non-Volatile Memory Optimized Key-Value Separated LSM-Tree
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [特集:情報システム論文] key-value-stores, log-structured merge-tree, non-volatile memory, RocksDB, key-value separation
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Graduate School of Systems and Information Engineering, University of Tsukuba
• 著者所属: ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属: ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属: ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属: Department of Computer Science, University of Tsukuba
• 著者所属: Department of Computer Science, University of Tsukuba
• 著者所属(英): en
• 著者所属(英): Graduate School of Systems and Information Engineering, University of Tsukuba
• 著者所属(英): en
• 著者所属(英): ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属(英): en
• 著者所属(英): ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属(英): en
• 著者所属(英): ICT Systems Laboratory, Fujitsu Research, Fujitsu Ltd.
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Tsukuba
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Tsukuba
• 著者名: Ryan, Nathanael Soenjoto Widodo; Hiroki, Ohtsuji; Erika, Hayashi; Eiji, Yoshida; Hirotake, Abe; Kazuhiko, Kato
• 著者名(英): Ryan, Nathanael Soenjoto Widodo; Hiroki, Ohtsuji; Erika, Hayashi; Eiji, Yoshida; Hirotake, Abe; Kazuhiko, Kato
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: LSM-tree-based key-value stores (KVSs) with KV separation minimizes the write latency and write amplification of LSM-trees by writing the KV-pairs sequentially into a log file and indexing these KV pairs in an LSM-tree. As a tradeoff, the storage device must handle the parallel writes directly from the client, which can be detrimental to some storage devices such as non-volatile memory (NVM). Such tasks can easily overload the underlying memory buffers of NVM, especially when these KVSs are configured without a filesystem to manage IO congestion and minimize the latency during parallel workloads. In this paper, we discuss how to maximize the performance of NVM in LSM-trees with KV separation called Non-Volatile KVS (NVKVS). This approach features several optimizations such as asynchronous multithreading that decouples the client and write threads and reusable write-ahead log (WAL). With these optimizations, NVKVS has three benefits. First, it minimizes the write latency by using NVM. Second, it can saturate the NVM throughput through a user-configurable worker pool and optimizations. Third, it leverages the endurance of NVM to maximize the lifespan of the SSD. Our experimental testings show that NVKVS produces better latencies and over double the throughput of other the tested KVS.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.30(2022) (online); DOI http://dx.doi.org/10.2197/ipsjjip.30.332; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: LSM-tree-based key-value stores (KVSs) with KV separation minimizes the write latency and write amplification of LSM-trees by writing the KV-pairs sequentially into a log file and indexing these KV pairs in an LSM-tree. As a tradeoff, the storage device must handle the parallel writes directly from the client, which can be detrimental to some storage devices such as non-volatile memory (NVM). Such tasks can easily overload the underlying memory buffers of NVM, especially when these KVSs are configured without a filesystem to manage IO congestion and minimize the latency during parallel workloads. In this paper, we discuss how to maximize the performance of NVM in LSM-trees with KV separation called Non-Volatile KVS (NVKVS). This approach features several optimizations such as asynchronous multithreading that decouples the client and write threads and reusable write-ahead log (WAL). With these optimizations, NVKVS has three benefits. First, it minimizes the write latency by using NVM. Second, it can saturate the NVM throughput through a user-configurable worker pool and optimizations. Third, it leverages the endurance of NVM to maximize the lifespan of the SSD. Our experimental testings show that NVKVS produces better latencies and over double the throughput of other the tested KVS.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.30(2022) (online); DOI http://dx.doi.org/10.2197/ipsjjip.30.332; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 63, 号 5, 発行日 2022-05-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764