【摘要】：隨著閃存存儲(chǔ)器和key-value存儲(chǔ)在企業(yè)應(yīng)用中越來越普及,如何提升key-value存儲(chǔ)在閃存存儲(chǔ)器上的性能也成為了一個(gè)新興的研究熱點(diǎn)。閃存存儲(chǔ)器相比于傳統(tǒng)的硬盤提供了更快的隨機(jī)讀寫速度,但在重寫時(shí),必須將已有的數(shù)據(jù)進(jìn)行擦除。為了更方便的使用閃存存儲(chǔ)器來替換傳統(tǒng)硬盤,閃存存儲(chǔ)器添加了一層閃存轉(zhuǎn)換層來封裝底層特性。改進(jìn)閃存轉(zhuǎn)換層的算法可以針對(duì)性的提高key-value存儲(chǔ)在閃存存儲(chǔ)器上的讀寫性能。 在基于對(duì)閃存轉(zhuǎn)換層的算法的相關(guān)研究和總結(jié)的基礎(chǔ)上,本文首先詳細(xì)分析了一種針對(duì)傳統(tǒng)數(shù)據(jù)庫(kù)的閃存轉(zhuǎn)換層算法-頁(yè)內(nèi)日志法的讀寫性能。另外基于key-value存儲(chǔ),本文分析并總結(jié)了頁(yè)內(nèi)日志法存在的不足和改進(jìn)方向。然后,本文提出了一種基于key-value存儲(chǔ)的閃存轉(zhuǎn)換層算法-組內(nèi)更新法,在詳細(xì)描述了算法設(shè)計(jì)后分析比較了該算法和傳統(tǒng)的FTL算法以及頁(yè)內(nèi)日志法的讀寫性能,并同時(shí)指出了算法的局限性及不足之處。 最終本文模擬并實(shí)現(xiàn)了閃存轉(zhuǎn)換層以及三種閃存轉(zhuǎn)換層算法,傳統(tǒng)的FTL算法,頁(yè)內(nèi)日志法以及組內(nèi)更新法,并通過三種不同的數(shù)據(jù)類型做了相關(guān)模擬仿真實(shí)驗(yàn),從實(shí)驗(yàn)數(shù)據(jù)中驗(yàn)證了頁(yè)內(nèi)日志法性能總體高于傳統(tǒng)的FTL算法,而同時(shí)在key-value存儲(chǔ)的前提下,組內(nèi)更新法的性能更好于頁(yè)內(nèi)日志法。
[Abstract]:With the increasing popularity of flash memory and key-value storage in enterprise applications, how to improve the performance of key-value storage on flash memory has become a new research hotspot. Flash memory provides faster random read and write speed than traditional hard drives, but existing data must be erased when rewriting. In order to replace the traditional hard disk with flash memory more conveniently, flash memory adds a layer of flash memory conversion layer to encapsulate the underlying characteristics. The improved flash conversion layer algorithm can improve the read and write performance of key-value stored on flash memory. Based on the research and summary of the algorithms of flash conversion layer, this paper firstly analyzes the performance of in-page log algorithm, which is a conversion layer algorithm for traditional database. In addition, based on key-value storage, this paper analyzes and summarizes the shortcomings and improvement direction of the in-page log method. Then, this paper presents a flash memory conversion layer algorithm based on key-value storage, which is called intra-group update algorithm. After describing the algorithm design in detail, the performance of the algorithm is compared with that of the traditional FTL algorithm and in-page log method. At the same time, the limitations and shortcomings of the algorithm are pointed out. Finally, this paper simulates and implements the conversion layer of flash memory and three algorithms of conversion layer of flash memory, traditional FTL algorithm, in-page log method and intra-group updating method, and makes related simulation experiments through three different data types. The experimental results show that the performance of in-page log method is higher than that of traditional FTL algorithm, and the performance of intra-group updating method is better than that of in-page log method under the premise of key-value storage.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP333

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 綦曉穎;湯顯;梁智超;孟小峰;;OAFTL:一種面向企業(yè)級(jí)應(yīng)用的高效閃存轉(zhuǎn)換層處理策略[J];計(jì)算機(jī)研究與發(fā)展;2011年10期

，

本文編號(hào)：2374946