本文關(guān)鍵詞： 閃存 閃存轉(zhuǎn)換層 地址映射 垃圾回收 緩沖區(qū)置換算法　出處：《中國地質(zhì)大學(xué)（北京）》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：近年來，由于閃存技術(shù)的飛速發(fā)展，以及閃存本身固有的非易失性、可以高速運行、體積小、耗能低、抗震動性及可靠性高的特點，，使得閃存成為嵌入式系統(tǒng)中的首選存儲介質(zhì)，并為企業(yè)級存儲系統(tǒng)開辟了新的前景。但是現(xiàn)有磁盤存儲技術(shù)無法直接運用在閃存存儲設(shè)備上。因此，研究一種適合閃存的高效存儲管理技術(shù)，將具有極其重要的意義。 在本論文中，首先總結(jié)了閃存存儲管理領(lǐng)域已存在的方案，分析出閃存管理的關(guān)鍵要素，并在地址映射、垃圾回收和緩沖區(qū)置換算法這幾個方面進行了探索研究，提出了對應(yīng)的解決方案。本論文主要包含以下方面： 1.提出了一種新穎的地址映射算法，該算法基于區(qū)塊切換結(jié)構(gòu)，簡稱為ZFTL。ZFTL是一種創(chuàng)新的純頁映射的閃存轉(zhuǎn)換層，該方案把整個閃存芯片劃分成多個區(qū)域加以管理。由于ZFTL方案每次只是把當前請求對應(yīng)區(qū)塊的地址信息緩存到內(nèi)存中，所以明顯地降低了內(nèi)存開銷，對集成度較高的內(nèi)存具有很好的擴展性。 2.提出了一種二級緩沖機制，該機制基于訪問模式選擇算法。充分利用閃存工作時的時間及空間局部性，極大地減少了地址轉(zhuǎn)換所造成的開銷。通過選擇性地對映射關(guān)系加以緩存，ZFTL可以高效地利用有限的內(nèi)存資源，顯著地提升了緩沖區(qū)的命中率，并減少了系統(tǒng)的響應(yīng)時間。 3.本論文還引入了一個用于驗證閃存轉(zhuǎn)換層算法的仿真平臺。該仿真平臺以FlashSim為基礎(chǔ)，對它進行了二次加工添加了ZFTL算法，實現(xiàn)了三種經(jīng)典FTL算法：頁映射、DFTL和FAST。 本論文最后的仿真步驟使用了從現(xiàn)實生活中獲取的訪問請求作為輸入源，在不同工作負載下對論文中的四種FTL算法進行了仿真，經(jīng)過對比加以分析，ZFTL方案優(yōu)勢明顯，在實際應(yīng)用中將極大地提高NAND Flash性能并降低成本。
[Abstract]:In recent years, due to the rapid development of the technology of flash memory and flash memory inherent in non-volatile, high speed, small volume, low power consumption, high reliability and anti vibration characteristics, has become the first choice of flash storage medium in embedded system, and open up new prospects for the enterprise but the existing storage system. Disk storage technology can not be directly used in the flash memory storage device. Therefore, a study of flash memory efficient storage management technology, will have the extremely vital significance.
In this paper, firstly summarizes the existing field of flash memory management scheme, analyzes the key elements of storage management, and address mapping, researches the garbage collection and buffer replacement algorithm of these aspects, puts forward corresponding solutions. This paper mainly includes the following aspects:
1. we propose a novel address mapping algorithm, the algorithm based on block switching structure, referred to as ZFTL.ZFTL is pure page mapping of an innovative flash translation layer, the scheme of the flash chip is divided into a plurality of regional management. Because the ZFTL program every time just to address information corresponding to the current request block cache memory so, significantly reduces the memory overhead, has good scalability for high-density memory.
2. proposed a two level buffer mechanism, the mechanism of access mode selection algorithm based on full use of flash when the time and spatial locality, greatly reduces the overhead caused by address translation. By selectively cached mappings, ZFTL can efficiently use the limited memory resources, and improve the the buffer hit ratio, and reduces the response time of the system.
3., this paper also introduced a simulation platform to verify the flash transfer layer algorithm. Based on FlashSim, the simulation platform was processed and added ZFTL algorithm for two times, and realized three classic FTL algorithms: page mapping, DFTL and FAST..
This paper uses simulation steps finally obtained from real-life access request as the input source in different work loads of four kinds of FTL algorithm in the paper is simulated. Through comparative analysis, the ZFTL scheme has obvious advantages, in the actual application will greatly improve the performance and reduce the cost of NAND Flash.

【學(xué)位授予單位】：中國地質(zhì)大學(xué)（北京）
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：TP333

【參考文獻】

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

1 于宗光,何耀宇;閃速存儲器的研究與進展[J];半導(dǎo)體技術(shù);1999年04期

2 李力;閃速存儲器技術(shù)現(xiàn)狀及發(fā)展趨勢[J];單片機與嵌入式系統(tǒng)應(yīng)用;2001年08期

相關(guān)碩士學(xué)位論文 前1條

1 易柏林;新型嵌入式移動存儲卡標準的研究與實現(xiàn)[D];北京郵電大學(xué);2007年

本文編號：1487882