基于NAND閃存的固態(tài)盤關(guān)鍵技術(shù)研究
發(fā)布時(shí)間：2018-08-12 14:38
【摘要】：近半個(gè)世紀(jì)來,隨著計(jì)算機(jī)體系結(jié)構(gòu)技術(shù)及芯片加工技術(shù)的不斷進(jìn)步,計(jì)算機(jī)系統(tǒng)的CPU性能與IO性能的差距不斷擴(kuò)大。計(jì)算機(jī)系統(tǒng)IO性能的瓶頸在于硬盤。這些年雖然磁盤容量有了迅速提升,但由于其存在機(jī)械旋轉(zhuǎn)結(jié)構(gòu),訪問速度提升有限,使得基于硬盤的存儲(chǔ)系統(tǒng)成為計(jì)算機(jī)系統(tǒng)的性能瓶頸之一。相比于傳統(tǒng)的硬盤,固態(tài)硬盤呈現(xiàn)出許多優(yōu)良的性能:低功耗,讀寫速度快,防震抗摔性好,無噪音,重量輕等,因此固態(tài)硬盤在許多領(lǐng)域已經(jīng)開始替代傳統(tǒng)硬盤。然而,固態(tài)硬盤也繼承閃存的缺點(diǎn),包括讀寫不對稱、寫前擦除、有限的擦除次數(shù)等。本文主要研究固態(tài)硬盤設(shè)計(jì)中的緩沖區(qū)管理算法和閃存轉(zhuǎn)換層算法,以減少對固態(tài)硬盤的寫和擦除次數(shù)。在緩沖區(qū)管理算法設(shè)計(jì)中,本文提出了一種面向頁級FTL的緩沖區(qū)管理算法——VBBMS(Virtual-Block-based Buffer Management Scheme)。首先,VBBMS將RAM分成隨機(jī)請求處理區(qū)和連續(xù)請求處理區(qū),分別用來處理隨機(jī)請求和連續(xù)請求;其次,VBBMS采用虛擬塊技術(shù),盡可能存儲(chǔ)訪問頻率高的數(shù)據(jù),并且對隨機(jī)請求進(jìn)行重構(gòu),將隨機(jī)的、小的請求變成順序的、大的連續(xù)請求發(fā)送給SDFTL,以減少閃存的讀寫次數(shù)和優(yōu)化垃圾回收的效率;最后,連續(xù)請求處理區(qū)通過預(yù)取數(shù)據(jù),利用請求的空間局部性,增加了緩沖區(qū)的命中率,進(jìn)一步了提升系統(tǒng)的整體性能。實(shí)驗(yàn)結(jié)果顯示,平均而言,VBBMS相比BPLRU算法,緩沖區(qū)命中率提高20.92%,響應(yīng)時(shí)間減少23.93%,塊擦除次數(shù)減少13.38%;相比CFLRU算法,緩沖區(qū)命中率提高29.33%,響應(yīng)時(shí)間減少28.09%,塊擦除次數(shù)減少48.77%;相比頁級LRU算法,緩沖區(qū)命中率提高44.16%,響應(yīng)時(shí)間減少33.70%,塊擦除次數(shù)減少55.75%。在閃存轉(zhuǎn)換層算法設(shè)計(jì)中,本文提出一種基于分類處理的聚簇頁級閃存轉(zhuǎn)換層算法——CPFTL(Clustered Page-level Flash Translation Layer)。首先,CPFTL將地址映射緩存分為熱映射表緩存、冷映射表緩存和連續(xù)映射表緩存,分別用來緩存訪問頻繁的請求的映射項(xiàng)、訪問不頻繁的請求的映射項(xiàng)和高空間本地性的請求的映射項(xiàng),有效提升了各類請求的處理能力。其次,為利用連續(xù)請求的空間本地性,CPFTL的連續(xù)映射表緩存預(yù)取多個(gè)連續(xù)的映射項(xiàng),提高它對連續(xù)請求的響應(yīng)性能。最后,為減少頁級映射算法的轉(zhuǎn)換頁讀寫開銷,CPFTL的冷映射表緩存采用聚簇策略,即將屬于同一轉(zhuǎn)換頁中的映射項(xiàng)進(jìn)行聚簇,按簇進(jìn)行LRU管理,當(dāng)冷映射表緩存滿時(shí),根據(jù)簇的映射項(xiàng)個(gè)數(shù)和LRU選取合適的簇剔除到閃存。實(shí)驗(yàn)結(jié)果顯示,平均而言,CPFTL相比經(jīng)典的DFTL算法,總體緩存命中率提高50.59%,響應(yīng)時(shí)間減少24.43%,地址轉(zhuǎn)換頁操作次數(shù)減少82.87%,塊擦除次數(shù)減少29.35%;相比最新的SDFTL算法,總體緩存命中率提升9.88%,響應(yīng)時(shí)間減少8.25%,地址轉(zhuǎn)換頁操作次數(shù)減少50.62%,閃存塊擦除次數(shù)減少9.26%。
[Abstract]:In the last half century, with the development of computer architecture technology and chip processing technology, the gap between CPU performance and IO performance of computer system is widening. The bottleneck of IO performance of computer system is hard disk. Although the disk capacity has increased rapidly in recent years, due to its mechanical rotation structure and limited access speed, the hard-disk storage system has become one of the performance bottlenecks of computer systems. Compared with the traditional hard disk, the solid-state hard disk presents many excellent performances: low power consumption, fast reading and writing speed, good shock resistance, no noise, light weight and so on. Therefore, the solid state hard disk has begun to replace the traditional hard disk in many fields. However, solid-state hard disk also inherits the disadvantages of flash memory, including reading and writing asymmetry, pre-write erasure, limited erasure times and so on. In this paper, buffer management algorithm and flash memory conversion layer algorithm in solid state hard disk design are studied to reduce the number of write and erase of solid state hard disk. In the design of buffer management algorithm, this paper proposes a new buffer management algorithm for page-level FTL named VBBMS (Virtual-Block-based Buffer Management Scheme). Firstly, RAM is divided into random request processing area and continuous request processing area, which are used to process random request and continuous request respectively. Secondly, VBBMS uses virtual block technology to store data with high access frequency as much as possible, and reconstructs random request. The random, small requests are sent to SDFTL in order to reduce the number of reads and writes in flash memory and optimize the efficiency of garbage collection. Finally, the continuous request processing area utilizes the spatial locality of the request by prefetching data. The hit ratio of buffer is increased, and the overall performance of the system is further improved. The experimental results show that, on average, compared with BPLRU algorithm, the hit rate of buffer increases 20.922.The response time decreases 23.933.The number of block erasure decreases 13.38. compared with CFLRU algorithm, VBBMS improves the hit rate of buffer by 20.922a, reduces the response time by 23.933.Compared with the CFLRU algorithm, The hit rate of buffer increases 29.33, the response time decreases 28.09, the number of block erasure decreases 48.77, compared with the page-level LRU algorithm, the hit ratio of buffer increases 44.16, the response time decreases 33.70, and the number of block erasure decreases 55.75. In the design of flash memory conversion layer algorithm, this paper presents a clustering page level flash conversion layer algorithm based on classification processing: CPFTL (Clustered Page-level Flash Translation Layer).) First of all, CPFTL divides the address mapping cache into hot map cache, cold map table cache and continuous mapping table cache, which are used to cache the mapping items that access frequent requests, respectively. To access the mapping items of infrequent requests and high spatial local requests, the processing ability of all kinds of requests is improved effectively. Secondly, in order to use the continuous mapping table of CPFTL to cache multiple consecutive mapping items, the response performance of CPFTL to continuous requests is improved. Finally, in order to reduce the conversion page reading and writing overhead of page-level mapping algorithm, the cold mapping table cache of CPFTL adopts clustering strategy, that is, the mapping items belonging to the same conversion page are clustered, and LRU is managed by cluster. When the cold mapping table is full, Select suitable cluster to flash memory according to the number of mapping items and LRU. The experimental results show that, on average, compared with the classical DFTL algorithm, the total cache hit ratio is increased by 50.59, the response time is reduced by 24.43, the number of operations on the address conversion page is reduced by 82.87, the number of block erasures is reduced by 29.35, and compared with the latest SDFTL algorithm, The total hit rate of cache increases 9.88, the response time decreases 8.25, the number of operations of address conversion page reduces 50.62and the number of flash block erasures decreases 9.26.
【學(xué)位授予單位】：杭州電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2016
【分類號】：TP333
本文編號：2179360
[Abstract]:In the last half century, with the development of computer architecture technology and chip processing technology, the gap between CPU performance and IO performance of computer system is widening. The bottleneck of IO performance of computer system is hard disk. Although the disk capacity has increased rapidly in recent years, due to its mechanical rotation structure and limited access speed, the hard-disk storage system has become one of the performance bottlenecks of computer systems. Compared with the traditional hard disk, the solid-state hard disk presents many excellent performances: low power consumption, fast reading and writing speed, good shock resistance, no noise, light weight and so on. Therefore, the solid state hard disk has begun to replace the traditional hard disk in many fields. However, solid-state hard disk also inherits the disadvantages of flash memory, including reading and writing asymmetry, pre-write erasure, limited erasure times and so on. In this paper, buffer management algorithm and flash memory conversion layer algorithm in solid state hard disk design are studied to reduce the number of write and erase of solid state hard disk. In the design of buffer management algorithm, this paper proposes a new buffer management algorithm for page-level FTL named VBBMS (Virtual-Block-based Buffer Management Scheme). Firstly, RAM is divided into random request processing area and continuous request processing area, which are used to process random request and continuous request respectively. Secondly, VBBMS uses virtual block technology to store data with high access frequency as much as possible, and reconstructs random request. The random, small requests are sent to SDFTL in order to reduce the number of reads and writes in flash memory and optimize the efficiency of garbage collection. Finally, the continuous request processing area utilizes the spatial locality of the request by prefetching data. The hit ratio of buffer is increased, and the overall performance of the system is further improved. The experimental results show that, on average, compared with BPLRU algorithm, the hit rate of buffer increases 20.922.The response time decreases 23.933.The number of block erasure decreases 13.38. compared with CFLRU algorithm, VBBMS improves the hit rate of buffer by 20.922a, reduces the response time by 23.933.Compared with the CFLRU algorithm, The hit rate of buffer increases 29.33, the response time decreases 28.09, the number of block erasure decreases 48.77, compared with the page-level LRU algorithm, the hit ratio of buffer increases 44.16, the response time decreases 33.70, and the number of block erasure decreases 55.75. In the design of flash memory conversion layer algorithm, this paper presents a clustering page level flash conversion layer algorithm based on classification processing: CPFTL (Clustered Page-level Flash Translation Layer).) First of all, CPFTL divides the address mapping cache into hot map cache, cold map table cache and continuous mapping table cache, which are used to cache the mapping items that access frequent requests, respectively. To access the mapping items of infrequent requests and high spatial local requests, the processing ability of all kinds of requests is improved effectively. Secondly, in order to use the continuous mapping table of CPFTL to cache multiple consecutive mapping items, the response performance of CPFTL to continuous requests is improved. Finally, in order to reduce the conversion page reading and writing overhead of page-level mapping algorithm, the cold mapping table cache of CPFTL adopts clustering strategy, that is, the mapping items belonging to the same conversion page are clustered, and LRU is managed by cluster. When the cold mapping table is full, Select suitable cluster to flash memory according to the number of mapping items and LRU. The experimental results show that, on average, compared with the classical DFTL algorithm, the total cache hit ratio is increased by 50.59, the response time is reduced by 24.43, the number of operations on the address conversion page is reduced by 82.87, the number of block erasures is reduced by 29.35, and compared with the latest SDFTL algorithm, The total hit rate of cache increases 9.88, the response time decreases 8.25, the number of operations of address conversion page reduces 50.62and the number of flash block erasures decreases 9.26.
【學(xué)位授予單位】：杭州電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2016
【分類號】：TP333
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 姚英彪;沈佐兵;;基于連續(xù)緩存和二級緩存的DFTL改進(jìn)算法[J];計(jì)算機(jī)研究與發(fā)展;2014年09期
2 謝徐超;宋振龍;李瓊;魏登萍;方健;肖立權(quán);;WAPFTL:支持預(yù)測機(jī)制的負(fù)載自適應(yīng)閃存轉(zhuǎn)換層算法[J];計(jì)算機(jī)工程與科學(xué);2014年07期
3 陳金忠;姚念民;蔡紹濱;戰(zhàn)福瑞;孫美玲;;基于頁面寫相關(guān)的閃存轉(zhuǎn)換層策略[J];通信學(xué)報(bào);2013年06期
4 李紅艷;;SMARC:一種結(jié)合SLC和MLC的混合固態(tài)盤架構(gòu)[J];計(jì)算機(jī)應(yīng)用研究;2013年08期
5 吳素貞;陳曉熹;毛波;;GC-RAIS:一種基于垃圾回收感知的固態(tài)盤陣列[J];計(jì)算機(jī)研究與發(fā)展;2013年01期
6 范玉雷;賴文豫;孟小峰;;基于固態(tài)硬盤內(nèi)部并行的數(shù)據(jù)庫表掃描與聚集[J];計(jì)算機(jī)學(xué)報(bào);2012年11期
7 鄭武;肖寶森;;串口通信新模型的研究與C#實(shí)現(xiàn)[J];電腦編程技巧與維護(hù);2012年11期
8 趙鵬;白石;;基于隨機(jī)游走的大容量固態(tài)硬盤磨損均衡算法[J];計(jì)算機(jī)學(xué)報(bào);2012年05期
9 湯顯;孟小峰;梁智超;盧澤萍;;基于代價(jià)的閃存數(shù)據(jù)庫緩沖區(qū)置換算法[J];軟件學(xué)報(bào);2011年12期
10 劉柳;黃德才;;一種邏輯塊溫度和物理塊年齡的磨損均衡算法[J];計(jì)算機(jī)系統(tǒng)應(yīng)用;2011年12期
，本文編號：2179360
本文鏈接：http://www.sikaile.net/kejilunwen/jisuanjikexuelunwen/2179360.html
最近更新
教材專著
