CN102981963A - Implementation method for flash translation layer of solid-state disc - Google Patents
Implementation method for flash translation layer of solid-state disc Download PDFInfo
- Publication number
- CN102981963A CN102981963A CN2012104274849A CN201210427484A CN102981963A CN 102981963 A CN102981963 A CN 102981963A CN 2012104274849 A CN2012104274849 A CN 2012104274849A CN 201210427484 A CN201210427484 A CN 201210427484A CN 102981963 A CN102981963 A CN 102981963A
- Authority
- CN
- China
- Prior art keywords
- page
- page number
- mapping table
- mapping relations
- buffer memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/72—Details relating to flash memory management
- G06F2212/7201—Logical to physical mapping or translation of blocks or pages
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention discloses an implementation method for a flash translation layer of a solid-state disc. The implementation method includes that a read-write request sent by a file system is received and corresponds to a page with a logic address K; whether the logic address K is targeted in a cache mapping table is judged; if the logic address K is not targeted in the cache mapping table, whether the number (n) of mapping relations to be transferred to the cache mapping table for one time can be contained in the cache mapping table is judged; if the number (n) of mapping relations cannot be contained in the cache mapping table, a logic page number Victim_Num of a mapping relation which is used the least recently is found out in the cache mapping table, all logic page numbers stored in the same page as the mapping relation of the Victim_Num are found in the cache mapping table, and n mapping relations used the least recently are found from mapping relations corresponding to the logic page numbers; and then corresponding mapping relations are found in a global conversion directory according to the Victim_Num. The implementation method for the flash translation layer of the solid-state disc is higher in read-write efficiency, improves performance of the system, and prolongs the service life of the solid-state disc.
Description
Technical field
The invention belongs to the solid-state disk technical field of memory, more specifically, relate to a kind of implementation method of flash translation layer (FTL) of solid-state disk.
Background technology
In recent years, flash memory (Flash) technology leads the new change of field of storage., the many advantages such as speed fast, low in energy consumption, noiseless anti-vibration little by feat of its volume are replacing traditional mechanical hard disk gradually.
Fully different with conventional hard, as shown in Figure 1, flash chip of the prior art (FlashChip) 101 is comprised of a plurality of (Block) 102, a piece 102 is comprised of a plurality of page or leaf (Page) 103, be generally 64, and be divided into two zones in a page or leaf 103, be respectively data field 104(DataArea) and OOB district (Out-of Band area) 105 compositions.The data field is 512B in the general page or leaf 103, and OOB then is 16B.Wherein the major function of OOB is the state of record Hamming checking code, the logic page number and current page, i.e. free time/invalidating (Free/Valid/Invalid).
Just be based on this design feature of flash memory self, it also has its disadvantageous one side, is mainly manifested in four aspects: 1, in read-write time, will be take page or leaf as unit, can not be take data as unit; 2, to wipe take Block as unit before writing, namely can not cover and write (Over-write), when data need to be revised, can not as disk, revise in direct original place, and needs this data block is wiped after data writing again again; 3, the erasing times of Block is limited, and namely the life-span of flash memory is limited.Therefore flash memory can not directly be used by traditional file systems as mechanical disk memory.
In order to take full advantage of technology and the product of the accumulation of traditional magnetic disk field, all big enterprises all are packaged into one or more flash chip combinations solid-state disk (the Solid State Drive of a look-alike disk, be called for short SSD), for upper layer application provides the interface the same with traditional magnetic disk, and do not need revised file system and application.Therefore, need block device that a flash translation layer (FTL) (Flash translation layer is called for short FTL) is modeled to solid-state disk standard shielding its characteristic so that the topmost paper system when using it just as using a common magnetic disk memory.
As shown in Figure 2, the solid-state disk system of prior art comprises file system (taking the sector as unit), FTL, flash drive and flash chip from top to bottom, wherein FTL comprises again three bulks, the address mapping is about to the topmost paper system converts solid-state disk to as the logical address of unit take the sector physical address, this is topmost part among the FTL, and garbage reclamation and abrasion equilibrium realize that each flash memory reclaims the flash block that lost efficacy in the situation of abrasion equilibrium.
In existing FTL, write the characteristic that front needs are wiped although can shield it to upper system, still have obvious weak point: 1, the buffer scheduling algorithm of the inside does not have well the read write attribute in conjunction with solid-state disk; For example, present page or leaf level mapping FTL relatively more commonly used lru algorithm commonly used in calling in the traditional file systems that mapping relations use in the buffer memory, namely only call in mapping relations at every turn, but solid-state disk is as the read-write unit take page or leaf, call in mapping relations and need to read whole mapped page, access mapping relations of renewal and need to write whole mapped page.Illustrate that this cache management mechanism is not suitable for solid-state disk; 2, the buffer scheduling utilization among the existing FTL is the spatial locality of data, and still immature to the utilization of sequential locality.In the actual storage system, may have the multilayer buffer memory, and the buffer memory of solid-state disk is in the bottom.When the I/O of system asks through the buffer memory of arrival solid-state disk after the filtration of upper strata buffer memorys at different levels, almost there has not been spatial locality.Therefore to be used on the solid-state disk hit rate unsatisfactory for the algorithm that accesses of existing FTL.And the solid-state disk buffer memory does not hit expense very large (if need to upgrade mapping, do not hit expense and comprise twice read operation and a write operation), seriously reduces the life-span of hard disk.
Summary of the invention
Defective for prior art, the object of the present invention is to provide a kind of implementation method of flash translation layer (FTL) of solid-state disk, its read-write efficiency is higher, be more suitable for solid-state disk, and dispatch forward and batch updating Effective Raise cache hit rate and reduce the update times of flash memory by multilist, and then the performance of raising system, the life-span of prolongation solid-state disk.
For achieving the above object, the invention provides a kind of implementation method of flash translation layer (FTL) of solid-state disk, may further comprise the steps:
(1) receive the read-write requests that file system is sent, this read-write requests is the page of K corresponding to logical address, and wherein K is positive integer;
(2) whether decision logic address K hits in the buffer memory mapping table, if yes then enter step (13), otherwise enters step (3);
(3) judge whether can admit again the mapping relations number n that once calls in the buffer memory mapping table in the buffer memory mapping table, if can admit, then turn step (11), otherwise turn step (4);
(4) in the buffer memory mapping table, find out the logical page number (LPN) Victim_Num of least-recently-used mapping relations;
(5) mapping relations of finding out in the buffer memory mapping table with Victim_Num are stored in mapping table with all logical page number (LPN)s in one page, and find out n least-recently-used mapping relations from mapping relations corresponding to these logical page number (LPN)s;
(6) in the global transformation catalogue, search out corresponding mapping relations according to Victim_Num, particularly, divide exactly the 512 rear E of being with Victim_Num, remainder is F, illustrate logical page number (LPN) be the mapping relations of Victim_Num to be stored in the logical mappings page number be that E, skew are the position of F, be that the page stores of E is the position of B at the physical mappings page number to the logical mappings page number by the global transformation directory search;
(7) finding the physical mappings page number in mapping table is the page of B, and compares with the mapping relations in the buffer memory mapping table, but judges whether that the identical corresponding physical page number of logical page number (LPN) is different, if having, then turns step (8); Otherwise turn step (10);
(8) in mapping table, find an available page or leaf, its physical mappings page number is C, the mapping relations that physical mappings page number B is appeared in the buffer memory mapping table are updated among this available page or leaf C, and copy among this available page or leaf C not appearing at mapping relations in the buffer memory mapping table among the physical mappings page number B, be that the page setup of B is invalid with the physical mappings page number, etc. to be recycled, and be that the page of C is set to effectively by available with the physical mappings page number;
(10) in the buffer memory mapping table, remove n least-recently-used page-map relation;
(11) determine to be G after logical address K divides exactly 512 that remainder is H, and finds physical mappings page number M corresponding to logical mappings page number G in the global transformation catalogue;
(12) finding the physical mappings page number in mapping table is the page of M, finds the mapping relations of its skew H again, with itself and back accessing with the continuous n-1 bar mapping relations in one page, join in the buffer memory mapping table;
(13) finding logical page number (LPN) in the buffer memory mapping table is the record of K, obtains its physical page number J;
(14) finding physical page number in data block is the page of J, and the address of this page is returned to file system.
The value of once calling in the mapping relations number n of buffer memory mapping table is 4-16.
By the above technical scheme that the present invention conceives, compared with prior art, the present invention has following beneficial effect:
1, improved cache hit rate: because in step (13), carried out multilist and dispatched forward, a plurality of continuous mapping relations are called in a read operation, from dividing the sequential locality that has utilized the bottom buffer memory.
2, reduce the read-write number of times of flash memory: because in step (5) and (10), adopted the technology of batch updating, under the prerequisite that does not increase the read-write number of times, carry out batch updating.
3, prolonged the life-span of flash memory: because adopted step (5) and (10), so that the minimizing of the read-write number of times of Flash, thereby prolong its serviceable life.
4, utilized sequential locality: because adopted step (13), call in mapping relations among the CMT and be continuous in the n bar record in one page.When calling in the mapping of current needs, probably to use after calling in mapping, not only utilized spatial locality (in the buffer memory of upper strata), also effectively utilized sequential locality, even if through also can further greatly improving cache hit rate after the filtration of upper strata I/O.
Description of drawings
Fig. 1 is the structural representation of the flash chip of prior art.
Fig. 2 is the structural representation of the solid-state disk system of prior art.
Fig. 3 is the design structure diagram of implementation method of the flash translation layer (FTL) of solid-state disk of the present invention.
Fig. 4 reads and writes schematic flow sheet in the inventive method.
Fig. 5 is the process flow diagram of implementation method of the flash translation layer (FTL) of solid-state disk of the present invention.
Fig. 6 is the flash memory conversion method of prior art and the contrast of the inventive method read-write number of times.
Fig. 7 is the contrast of flash memory conversion method and the inventive method erasing times of prior art.
Fig. 8 is the flash memory conversion method of prior art and the contrast of the inventive method cache hit rate.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, is not intended to limit the present invention.
Below at first technical term of the present invention is explained and illustrated.
The buffer memory mapping table: Cache Mapping Table, after this be called for short CMT, be used for mapping table in the storage activities;
Mapping table: Translation Blocks, store all logical page number (LPN)s to the mapping relations of physical page number;
Data block: Data Blocks is used for storing user's True Data;
The global transformation catalogue: Global Translation Directory, there is which page in the mapping table in the mapping relations that are used for following the trail of logical address number;
DLPN:Logical Data Page Number, logical page number (LPN);
DPPN:Physical Data Page Number, physical page number;
MVPN:Virtual Translation Page Number, the logical mappings page number;
MPPN::Physical Translation Page Number, the physical mappings page number;
Below in conjunction with the accompanying drawing in the invention process example, the technical scheme in the example of the present invention is carried out clear, complete description, obviously, described embodiment is a part of example of the present invention, rather than whole embodiment.Based on embodiments of the invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
As shown in Figure 3, the flash chip that the implementation method of the flash translation layer (FTL) of solid-state disk of the present invention is applied to is divided into four bulks altogether, and buffer memory mapping table (Cached Mapping Table, be called for short CMT) is used for the mapping table in the storage activities; Global transformation catalogue (Global Translation Directory, be called for short GTD), the mapping relations that are used for following the trail of logical address number exist in which page of mapping table; CMT and GTD leave among the SRAM; Data block (Data Block) and mapping table (TranslationBlock), it all is arranged in flash memory, wherein data block accounts for the overwhelming majority, data block store be user data truly, mapping table is then stored all logical addresses in the data block to the mapping relations of physical address.
The present invention fully takes into account the read write attribute of solid-state disk, when the buffer memory mapping table completely need to access a part of mapping relations, will with neutralize at mapping table that this is recorded in other mapping relations update all (being called for short the batch updating technology) in the same page or leaf, do not increasing in the situation of read-write number of times like this, reduce the number of times of writing of mapping table, and then prolonged the solid-state disk life-span.
In addition, taken into full account combination with the upper strata buffer memory calling in strategy among the present invention.Owing to taken full advantage of spatial locality in the buffer memory of upper strata, consider the filtration of upper strata buffer memory, in solid-state disk, can greatly descend with the LRU hit rate, so the present invention utilizes sequential locality in calling in strategy, namely once call in a plurality of continuous mapping relations (being called for short multilist dispatches forward) in the buffer memory mapping table, experiment draws, and has so greatly improved cache hit rate.
In addition, when the buffer memory mapping table completely need to be called in a plurality of mapping relations, must in buffer memory, access a plurality of mapping relations.In CMT, find out first the logical page number (LPN) Victim_Num of least-recently-used mapping relations this moment, then find out in the mapping table with Victim_Num in the mapping relations that appear at all of one page among the CMT, therefrom find out again n-1(wherein n for once calling in the mapping relations number of CMT) individual least-recently-used mapping relations access.
Shown in Figure 4 and 5, the implementation method of the flash translation layer (FTL) of solid-state disk of the present invention may further comprise the steps:
(1) receive the read-write requests that file system is sent, this read-write requests is that K(K is positive integer corresponding to logical address) the page, shown in (1) among Fig. 4, in illustrated example, K=1280;
(2) whether decision logic address K hits in CMT, if yes then enter step (13), otherwise enters step (3);
(3) judge among the CMT whether can admit n, wherein n if can admit, then turns step (11) for once to call in the mapping relations number of CMT, otherwise turns step (4) again; Usually the value of n is 4-16, in illustrated example, and n=4;
(4) in CMT, find out the logical page number (LPN) Victim_Num of least-recently-used mapping relations, shown in (4) among Fig. 4, in illustrated example, get Victim Num=1;
(5) mapping relations of finding out in CMT with Victim_Num are stored in mapping table with all logical page number (LPN)s in one page (because logical page number (LPN) is order in mapping table, at same one page such as logic number 0-511,512-1024 is at same one page), and from mapping relations corresponding to these logical page number (LPN)s, find out n least-recently-used mapping relations, shown in (5) among Fig. 4, n logical page number (LPN) is respectively 1,2,4,7;
(6) in GTD, search out corresponding mapping relations (in GTD according to Victim_Num, the relation record of mapping is that order is deposited), particularly, be E after Victim_Num divides exactly 512 among the figure, remainder is F, illustrate logical page number (LPN) be the mapping relations of Victim_Num to be stored in the logical mappings page number be that E, skew are the position of F, finding the logical mappings page number by GTD is that the page stores of E is the position of B at the physical mappings page number; For example, shown in (7) among Fig. 4, B=21, be 0 after Victim_Num divides exactly 512, remainder is 1, illustrate that logical page number (LPN) is that the mapping relations of Victim_Num are stored in that the logical mappings page number is 0, skew is 1 position, finding the logical mappings page number by GTD is that 0 page stores is 21 position at the physical mappings page number;
(7) finding the physical mappings page number in mapping table is the page of B, and compares with the mapping relations among the CMT, but judges whether that the identical corresponding physical page number of logical page number (LPN) is different, if having, then turns step (8); Otherwise turn step (10);
(8) in mapping table, find an available page or leaf, its physical mappings page number is C, the mapping relations that physical mappings page number B is appeared among the CMT are updated among this available page or leaf C, and copy among this available page or leaf C not appearing at mapping relations among the CMT among the physical mappings page number B, be that the page setup of B is invalid with the physical mappings page number, wait to be recycled, and be that the page of C is set to effectively by available with the physical mappings page number, shown in (8) among Fig. 4, in illustrated example, get C=23;
(9) the physical mappings page number B that logical mappings page number E is corresponding changes to C in GTD, and for example, shown in (9) among Fig. 4, the physical mappings page number 21 with logical mappings page number 0 correspondence in GTD changes to 23;
(10) removing n least-recently-used page-map relation in CMT, in illustrated example, is that logical page number (LPN) is four records of 1,2,4,10;
(11) determine to be G after logical address K divides exactly 512 that remainder is H, and finds physical mappings page number M corresponding to logical mappings page number G in GTD, shown in (11) among Fig. 4, logical address 1280 divides exactly 512 rear G=2, remainder H=256, M=15;
(12) finding the physical mappings page number in mapping table is the page of M, finds the mapping relations of its skew H again, with itself and back accessing with the continuous n-1 bar mapping relations in one page, join among the CMT, shown in (12) among Fig. 4;
(13) finding logical page number (LPN) in CMT is the record of K, obtains its physical page number J, shown in (13) among Fig. 4, and J=660;
(14) finding physical page number in data block is the page of J, and the address of this page is returned to file system.
Fig. 6 and Fig. 7 are respectively the readwrite performance of existing flash memory conversion method and the inventive method and the contrast of erasing times, as can be seen from the figure, method of the present invention can effectively reduce read-write number of times and erasing times, wherein, read number of times less 54.21%, write number of times less 15.74%, erasing times is less 15.75%.
Fig. 8 is the contrast of the cache hit rate of existing flash memory conversion method and the inventive method, and as can be seen from the figure cache hit rate has improved 20.1%.
Those skilled in the art will readily understand; the above only is preferred embodiment of the present invention; not in order to limiting the present invention, all any modifications of doing within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within protection scope of the present invention.
Claims (2)
1. the implementation method of the flash translation layer (FTL) of a solid-state disk is characterized in that, may further comprise the steps:
(1) receive the read-write requests that file system is sent, this read-write requests is the page of K corresponding to logical address, and wherein K is positive integer;
(2) whether decision logic address K hits in the buffer memory mapping table, if yes then enter step (13), otherwise enters step (3);
(3) judge whether can admit again the mapping relations number n that once calls in the buffer memory mapping table in the buffer memory mapping table, if can admit, then turn step (11), otherwise turn step (4);
(4) in the buffer memory mapping table, find out the logical page number (LPN) Victim_Num of least-recently-used mapping relations;
(5) mapping relations of finding out in the buffer memory mapping table with Victim_Num are stored in mapping table with all logical page number (LPN)s in one page, and find out n least-recently-used mapping relations from mapping relations corresponding to these logical page number (LPN)s;
(6) in the global transformation catalogue, search out corresponding mapping relations according to Victim_Num, particularly, divide exactly the 512 rear E of being with Victim_Num, remainder is F, illustrate logical page number (LPN) be the mapping relations of Victim_Num to be stored in the logical mappings page number be that E, skew are the position of F, be that the page stores of E is the position of B at the physical mappings page number to the logical mappings page number by the global transformation directory search;
(7) finding the physical mappings page number in mapping table is the page of B, and compares with the mapping relations in the buffer memory mapping table, but judges whether that the identical corresponding physical page number of logical page number (LPN) is different, if having, then turns step (8); Otherwise turn step (10);
(8) in mapping table, find an available page or leaf, its physical mappings page number is C, the mapping relations that physical mappings page number B is appeared in the buffer memory mapping table are updated among this available page or leaf C, and copy among this available page or leaf C not appearing at mapping relations in the buffer memory mapping table among the physical mappings page number B, be that the page setup of B is invalid with the physical mappings page number, etc. to be recycled, and be that the page of C is set to effectively by available with the physical mappings page number;
(10) in the buffer memory mapping table, remove n least-recently-used page-map relation;
(11) determine to be G after logical address K divides exactly 512 that remainder is H, and finds physical mappings page number M corresponding to logical mappings page number G in the global transformation catalogue;
(12) finding the physical mappings page number in mapping table is the page of M, finds the mapping relations of its skew H again, with itself and back accessing with the continuous n-1 bar mapping relations in one page, join in the buffer memory mapping table;
(13) finding logical page number (LPN) in the buffer memory mapping table is the record of K, obtains its physical page number J;
(14) finding physical page number in data block is the page of J, and the address of this page is returned to file system.
2. implementation method according to claim 1 is characterized in that, the value of once calling in the mapping relations number n of buffer memory mapping table is 4-16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210427484.9A CN102981963B (en) | 2012-10-30 | 2012-10-30 | A kind of implementation method of flash translation layer (FTL) of solid-state disk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210427484.9A CN102981963B (en) | 2012-10-30 | 2012-10-30 | A kind of implementation method of flash translation layer (FTL) of solid-state disk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102981963A true CN102981963A (en) | 2013-03-20 |
| CN102981963B CN102981963B (en) | 2015-12-02 |
Family
ID=47856015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210427484.9A Active CN102981963B (en) | 2012-10-30 | 2012-10-30 | A kind of implementation method of flash translation layer (FTL) of solid-state disk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102981963B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136121A (en) * | 2013-03-25 | 2013-06-05 | 中国人民解放军国防科学技术大学 | Cache management method for solid-state disc |
| CN103425600A (en) * | 2013-08-23 | 2013-12-04 | 中国人民解放军国防科学技术大学 | Address mapping method for flash translation layer of solid state drive |
| CN104102591A (en) * | 2013-04-08 | 2014-10-15 | 香港理工大学 | Computer subsystem and method for implementing flash translation layer in computer subsystem |
| CN104166634A (en) * | 2014-08-12 | 2014-11-26 | 华中科技大学 | Management method of mapping table caches in solid-state disk system |
| CN104268094A (en) * | 2014-09-23 | 2015-01-07 | 浪潮电子信息产业股份有限公司 | Optimized flash memory address mapping method |
| CN106155579A (en) * | 2015-04-27 | 2016-11-23 | 广明光电股份有限公司 | The method of solid state hard disc dynamic storing conversion layer data |
| CN106326134A (en) * | 2015-06-30 | 2017-01-11 | 华为技术有限公司 | Flash Translation Layer (FTL) address mapping method and device |
| CN106502928A (en) * | 2016-09-29 | 2017-03-15 | 华为技术有限公司 | A kind of storage system power-off protection method, storage control and electronic equipment |
| CN106815152A (en) * | 2016-12-27 | 2017-06-09 | 华中科技大学 | A kind of method for optimizing page level flash translation layer (FTL) |
| CN107179996A (en) * | 2016-03-10 | 2017-09-19 | 爱思开海力士有限公司 | Data storage device and its operating method |
| CN107368436A (en) * | 2017-06-29 | 2017-11-21 | 西安交通大学 | A kind of cold and hot data separating storage method of flash memory for combining address mapping table |
| US20170344575A1 (en) * | 2016-05-27 | 2017-11-30 | Netapp, Inc. | Methods for facilitating external cache in a cloud storage environment and devices thereof |
| CN107632939A (en) * | 2016-07-19 | 2018-01-26 | 西部数据技术公司 | Mapping table for storage device |
| CN109725825A (en) * | 2017-10-27 | 2019-05-07 | 伊姆西Ip控股有限责任公司 | For managing method, equipment and the computer program product of caching |
| CN110007876A (en) * | 2019-04-15 | 2019-07-12 | 苏州浪潮智能科技有限公司 | A kind of solid state hard disk date storage method, device, equipment and medium |
| CN110059021A (en) * | 2019-04-18 | 2019-07-26 | 深圳市时创意电子有限公司 | A kind of algorithm for reducing write-in magnifying power and promoting random writing performance |
| CN110262982A (en) * | 2019-05-05 | 2019-09-20 | 杭州电子科技大学 | A kind of method of solid state hard disk address of cache |
| CN113220241A (en) * | 2021-05-27 | 2021-08-06 | 衢州学院 | Cross-layer design-based hybrid SSD performance and service life optimization method |
| WO2022199027A1 (en) * | 2021-03-25 | 2022-09-29 | 湖南国科微电子股份有限公司 | Random write method, electronic device and storage medium |
| CN116010298A (en) * | 2023-03-24 | 2023-04-25 | 温州市特种设备检测科学研究院(温州市特种设备应急处置中心) | NAND type flash memory address mapping method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102043721A (en) * | 2010-05-12 | 2011-05-04 | 中颖电子股份有限公司 | Memory management method for flash memory |
| CN102521156A (en) * | 2011-12-12 | 2012-06-27 | 云海创想信息技术（天津）有限公司 | Mapping relation access method and mapping relation access device |
-
2012
- 2012-10-30 CN CN201210427484.9A patent/CN102981963B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102043721A (en) * | 2010-05-12 | 2011-05-04 | 中颖电子股份有限公司 | Memory management method for flash memory |
| CN102521156A (en) * | 2011-12-12 | 2012-06-27 | 云海创想信息技术（天津）有限公司 | Mapping relation access method and mapping relation access device |
Non-Patent Citations (1)
| Title |
|---|
| LI BO1: "《IEEE/IEE Electronic Library (IEL)》", 18 July 2010 * |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136121B (en) * | 2013-03-25 | 2014-04-16 | 中国人民解放军国防科学技术大学 | Cache management method for solid-state disc |
| CN103136121A (en) * | 2013-03-25 | 2013-06-05 | 中国人民解放军国防科学技术大学 | Cache management method for solid-state disc |
| CN104102591A (en) * | 2013-04-08 | 2014-10-15 | 香港理工大学 | Computer subsystem and method for implementing flash translation layer in computer subsystem |
| CN103425600A (en) * | 2013-08-23 | 2013-12-04 | 中国人民解放军国防科学技术大学 | Address mapping method for flash translation layer of solid state drive |
| CN103425600B (en) * | 2013-08-23 | 2016-01-20 | 中国人民解放军国防科学技术大学 | Address mapping method in a kind of solid-state disk flash translation layer (FTL) |
| CN104166634A (en) * | 2014-08-12 | 2014-11-26 | 华中科技大学 | Management method of mapping table caches in solid-state disk system |
| CN104268094A (en) * | 2014-09-23 | 2015-01-07 | 浪潮电子信息产业股份有限公司 | Optimized flash memory address mapping method |
| CN104268094B (en) * | 2014-09-23 | 2017-05-03 | 浪潮电子信息产业股份有限公司 | Optimized flash memory address mapping method |
| CN106155579A (en) * | 2015-04-27 | 2016-11-23 | 广明光电股份有限公司 | The method of solid state hard disc dynamic storing conversion layer data |
| CN106326134A (en) * | 2015-06-30 | 2017-01-11 | 华为技术有限公司 | Flash Translation Layer (FTL) address mapping method and device |
| CN107179996A (en) * | 2016-03-10 | 2017-09-19 | 爱思开海力士有限公司 | Data storage device and its operating method |
| US20170344575A1 (en) * | 2016-05-27 | 2017-11-30 | Netapp, Inc. | Methods for facilitating external cache in a cloud storage environment and devices thereof |
| CN107632939A (en) * | 2016-07-19 | 2018-01-26 | 西部数据技术公司 | Mapping table for storage device |
| CN107632939B (en) * | 2016-07-19 | 2021-03-19 | 西部数据技术公司 | Mapping table for storage device |
| CN106502928B (en) * | 2016-09-29 | 2019-08-20 | 华为技术有限公司 | A kind of storage system power-off protection method, storage control and electronic equipment |
| CN106502928A (en) * | 2016-09-29 | 2017-03-15 | 华为技术有限公司 | A kind of storage system power-off protection method, storage control and electronic equipment |
| CN106815152A (en) * | 2016-12-27 | 2017-06-09 | 华中科技大学 | A kind of method for optimizing page level flash translation layer (FTL) |
| CN106815152B (en) * | 2016-12-27 | 2019-05-31 | 华中科技大学 | A method of optimization page grade flash translation layer (FTL) |
| CN107368436A (en) * | 2017-06-29 | 2017-11-21 | 西安交通大学 | A kind of cold and hot data separating storage method of flash memory for combining address mapping table |
| CN107368436B (en) * | 2017-06-29 | 2020-08-18 | 西安交通大学 | Flash memory cold and hot data separated storage method combined with address mapping table |
| CN109725825A (en) * | 2017-10-27 | 2019-05-07 | 伊姆西Ip控股有限责任公司 | For managing method, equipment and the computer program product of caching |
| CN109725825B (en) * | 2017-10-27 | 2022-03-11 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for managing a cache |
| CN110007876A (en) * | 2019-04-15 | 2019-07-12 | 苏州浪潮智能科技有限公司 | A kind of solid state hard disk date storage method, device, equipment and medium |
| CN110059021A (en) * | 2019-04-18 | 2019-07-26 | 深圳市时创意电子有限公司 | A kind of algorithm for reducing write-in magnifying power and promoting random writing performance |
| CN110262982A (en) * | 2019-05-05 | 2019-09-20 | 杭州电子科技大学 | A kind of method of solid state hard disk address of cache |
| WO2022199027A1 (en) * | 2021-03-25 | 2022-09-29 | 湖南国科微电子股份有限公司 | Random write method, electronic device and storage medium |
| CN113220241A (en) * | 2021-05-27 | 2021-08-06 | 衢州学院 | Cross-layer design-based hybrid SSD performance and service life optimization method |
| CN116010298A (en) * | 2023-03-24 | 2023-04-25 | 温州市特种设备检测科学研究院(温州市特种设备应急处置中心) | NAND type flash memory address mapping method and device, electronic equipment and storage medium |
| CN116010298B (en) * | 2023-03-24 | 2023-09-22 | 温州市特种设备检测科学研究院(温州市特种设备应急处置中心) | NAND type flash memory address mapping method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102981963B (en) | 2015-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| CN104268094B (en) | Optimized flash memory address mapping method | |
| CN103136121B (en) | Cache management method for solid-state disc | |
| CN103425600B (en) | Address mapping method in a kind of solid-state disk flash translation layer (FTL) | |
| CN104166634A (en) | Management method of mapping table caches in solid-state disk system | |
| Jiang et al. | S-FTL: An efficient address translation for flash memory by exploiting spatial locality | |
| KR101257691B1 (en) | Memory controller and data management method | |
| US8935484B2 (en) | Write-absorbing buffer for non-volatile memory | |
| US10740251B2 (en) | Hybrid drive translation layer | |
| CN102789427A (en) | Data storage device and operation method thereof | |
| CN104102591A (en) | Computer subsystem and method for implementing flash translation layer in computer subsystem | |
| CN109582593B (en) | FTL address mapping reading and writing method based on calculation | |
| CN103092766A (en) | Balanced loss achievement method for NAND FLASH | |
| WO2014074449A2 (en) | Wear leveling in flash memory devices with trim commands | |
| CN110413537B (en) | Flash translation layer facing hybrid solid state disk and conversion method | |
| CN109446117B (en) | Design method for page-level flash translation layer of solid state disk | |
| CN107391391A (en) | The method, system and solid state hard disc of data copy are realized in the FTL of solid state hard disc | |
| CN102646069A (en) | Method for prolonging service life of solid-state disk | |
| KR20100021868A (en) | Buffer cache management method for flash memory device | |
| KR20100115090A (en) | Buffer-aware garbage collection technique for nand flash memory-based storage systems | |
| KR101297442B1 (en) | Nand flash memory including demand-based flash translation layer considering spatial locality | |
| CN103543955A (en) | Method and system for reading cache with solid state disk as equipment and solid state disk | |
| CN108845957B (en) | Replacement and write-back self-adaptive buffer area management method | |
| KR101017067B1 (en) | Locality-Aware Garbage Collection Technique for NAND Flash Memory-Based Storage Systems | |
| CN103744798A (en) | Garbage recycling method of solid state discs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |