| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 邱麒亮 | zh_TW |
| DC.creator | Chi-Liang Qiu | en_US |
| dc.date.accessioned | 2023-8-17T07:39:07Z | |
| dc.date.available | 2023-8-17T07:39:07Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=110522019 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | Bϵ-樹在寫入密集的情況下，是一個很好的選擇，他將多個寫入請求合併到緩衝區，
這有助於減少寫入放大。SplinterDB [1] 是以Bϵ-樹實作而成，且配合了NVMe 裝置，然
而，他並不是為了開放通道式固態硬碟，我們提出了高度平行Bϵ-樹，他可以很好的利用
開放式固態硬碟有，而傳統固態硬碟沒有的優勢，在我們的論文中，提出一個方法，藉由
維持高度平行讀取，使得讀取延遲下降。 | zh_TW |
| dc.description.abstract | Bϵ-tree is a good candidate for write-intensive situations. It gathers multiple
write requests into its buffer. This helps reduce write amplification (WA).
SplinterDB [1] is implemented using Bϵ-trees and is compatible with NVMe
solid-state drives[1]. However, it’s not designed for open-channel SSDs[2].
We designed HP-Bϵ-tree to leverage the advantages of open-channel SSDs
over traditional SSDs. In this paper, we propose an approach to reduce read
latency by maintaining high degree of parallel reads. | en_US |
| DC.subject | Bϵ-樹 | zh_TW |
| DC.subject | 開放通道式固態硬數 | zh_TW |
| DC.subject | 鍵值儲存 | zh_TW |
| DC.subject | Bϵ-tree | en_US |
| DC.subject | Open-channel SSD | en_US |
| DC.subject | key-value store | en_US |
| DC.title | Freeing the Power of High Parallelism: Accelerating the Bϵ-Tree Indexing Scheme Performance on Open-Channel SSD | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |