CN101178689A - Dynamic state management techniques of NAND flash memory - Google Patents
Dynamic state management techniques of NAND flash memory Download PDFInfo
- Publication number
- CN101178689A CN101178689A CNA2007101645526A CN200710164552A CN101178689A CN 101178689 A CN101178689 A CN 101178689A CN A2007101645526 A CNA2007101645526 A CN A2007101645526A CN 200710164552 A CN200710164552 A CN 200710164552A CN 101178689 A CN101178689 A CN 101178689A
- Authority
- CN
- China
- Prior art keywords
- physical block
- empty
- block
- logical
- nand flash
- 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
- 230000015654 memory Effects 0.000 title claims description 6
- 238000000034 method Methods 0.000 title abstract description 16
- 238000013507 mapping Methods 0.000 claims description 28
- 238000013459 approach Methods 0.000 claims description 13
- 238000011084 recovery Methods 0.000 claims description 8
- 230000004069 differentiation Effects 0.000 claims description 7
- 238000005096 rolling process Methods 0.000 abstract description 5
- 230000008569 process Effects 0.000 description 13
- 238000007726 management method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000005299 abrasion Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
Images
Abstract
The invention relates to a dynamic managing method of an NAND Flash memorizer. The invention sets dynamic logic mapped table, in which when no used logic block is available, the physical block is not distributed temporarily; the dynamic logic mapped table searches the empty physical block in a rolling way according to the choice equal principle through arithmetic when in use, balances the using frequency of the physical block in the NAND Flash through the dynamic rolling of the table, takes one empty physical bock to distribute logic number as operating one logic block and adds to the logic mapped table to re-operate. The logic mapped table is gradually filled flowing the running of the system, abandons and reclaims the old physical blocks during amending the logic block data, and finds a new physical block to re-write back; the logic mapped table proceeds particular definition to the user byte in the redundant district of each page, distinguishes the dirty data only by compare the byte value. The software of the invention has high efficiency, realizing the balance use of the physical blocks and prolonging the service life of the NAND Flash memorizer.
Description
Technical field
The present invention relates to the technical field of flash memories, be specifically related to the management method of NAND Flash storer
Background technology
NAND Flash is extensive as a kind of storage medium application, but because its limited meeting of erasable number of times causes reduce serviceable life, so must adopt various erasable management algorithms to prolong the serviceable life of device on software when using.
NAND Flash main file system that adopts in application manages.Usually the way to manage of NAND Flash is to set up the logical mappings table when initialization in the file system, promptly scan all physical blocks and get rid of bad piece, each empty physical block is distributed a logical number and marks redundant area, perhaps read the logical number of having distributed to the logical mappings table, the logical mappings table of Jian Liing is static like this, all there is a logical number in each physical block, and seldom change (unless this piece damages) in system's operational process, what file allocation table (FAT) and root directory item write is the physical sector of fixing.The subject matter that this mode exists has: 1. the logical mappings table is static, and each more new data all needs the piece at revised file allocation table place, causes file allocation table place piece constantly by erasable, can cause this physical block to damage in the short period of time; 2. come the memory allocated unit according to file allocation table, can't plan the frequency of utilization of piece, front and back physical block frequency of utilization difference is big in the file system, and it is unbalanced to wear and tear, and has reduced the serviceable life of NAND Flash.
Present solution mainly is to introduce the erasable control algolithm of storage unit in NAND Flash read-write operation, and the erasable frequency of as far as possible balanced each unit is avoided the physical damage that causes because of erasable frequency distribution inequality.But existing algorithm exists software efficiency low, the problem that the software and hardware expense is big.
Summary of the invention
Low for the software efficiency of the management method that overcomes existing NAND Flash storer, to the deficiency that frequency of utilization can't be planned, serviceable life is low of physical block, the dynamic management approach of NAND Flash storer that the serviceable life of storer was used, prolonged in the equilibrium that the invention provides a kind of software synthesis efficient height, realizes physical block.
The technical solution adopted for the present invention to solve the technical problems is:
A kind of dynamic management approach of NAND Flash storer may further comprise the steps:
1), detect NAND Flash storer during initialization, get rid of all bad pieces;
2), set up empty logical mappings table during initialization, scan N AND Flash storer adds the physical block number that has logical number in the corresponding list item of logical mappings table, and it is empty that all the other logical mappings table list items keep;
3), set up empty physical block table and list index during initialization, scan N AND Flash storer will not have the piece of the physical block of logical number number to add in the sky physical block table;
4), set up rubbish piece table and list index during initialization, scan N AND Flash storer number adds the piece that is labeled as invalid physical block in the rubbish piece table to;
5), when writing the sky logical block, from empty physical block table, get an empty physical block and add in the logical block list item, again data are write in the new physical block;
When 6), revising logical block data, reading logical block corresponding physical blocks of data makes an amendment to buffer memory, get an empty physical block then and add in the same logical block list item from empty physical block table, write in the new physical block data cached, old physical block is labeled as invalid being put in the rubbish piece table.
As preferred a kind of scheme: described dynamic management approach is further comprising the steps of:
7), adopt the specifically defined differentiation dirty data of the user octet of redundant area, promptly definition of data record start and end mark mark whether to occur in pairs judging according to two; Dirty data is marked as invalid and is recovered.
As preferred another kind of scheme: regularly or free time reclaim the rubbish piece, directly from rubbish piece table, get invalid physical block during recovery, then erase block; Upgrade empty physical block table simultaneously, rubbish piece of every recovery increases an empty physical block at empty physical block table.
Further, if the rubbish number of blocks is not 0, then rubbish piece list index points to first rubbish piece in the rubbish piece table; Empty physical block list index points to first sky physical block in the empty physical block table.
Further again, the empty physical block that remains some is as backup, and is not empty to guarantee empty physical block table, and the logical mappings table can keep rolling.
Technical conceive of the present invention is: by sky physical block table and rubbish piece table are set, the method that employing is tabled look-up solves the speed issue in the dynamic rolling process and realizes the recovery of rubbish piece.
Algorithm of the present invention is to set up an empty logical mappings table when initialization, and scanning device reads the logical number of each physical block then, and two kinds of situations are arranged this moment:
1. for blank NAND Flash, promptly for the first time to this flash disk operation, all physical blocks all do not have logic number, and the logic number of reading is sky, then wouldn't be to physical block assignment logic number, and it is empty that the logical mappings table keeps.
2. for already used NAND Flash, read the logical number of each physical block, the piece that logical number is arranged is added in the logical mappings table, and empty physical block is not temporarily distributed logic number.
Corresponding above-mentioned two kinds of situations, logical block of the every operation of system is then got an empty physical block to its assignment logic number, adds the logical mappings table to, and the logical mappings table is along with the operation of system is filled gradually.Discarded and reclaim old physical block when revising logical block data, seek new physical block write-back again.The present invention in use seeks empty physical block by equal-opportunity principle and comes assignment logic number, each operation all can change the logical mappings table, what adopt like this is a dynamic logic mapping table, physical block in the table is dynamic change, empty physical block in the device uses probability identical, thereby reaches the purpose of balance abrasion.
Beneficial effect of the present invention mainly shows: 1, software synthesis efficient height; 2, realize the equilibrium use of physical block, the serviceable life of prolongation storer; 3, the software and hardware expense little, can and do good balance between serviceable life at cost, software efficiency; 4, be particularly suitable in embedded system, using.
Description of drawings
Fig. 1 is that sky physical block table is set up process flow diagram;
Fig. 2 writes sky logical block process flow diagram;
Fig. 3 revises data and upgrades rubbish piece table process flow diagram;
Fig. 4 reclaims the rubbish piece and upgrades empty physical block table process flow diagram;
Fig. 5 is a software overall work process flow diagram.
Embodiment
Below in conjunction with accompanying drawing the present invention is further described.
With reference to Fig. 1～Fig. 5, a kind of dynamic management approach of NAND Flash storer may further comprise the steps:
1), detect NAND Flash storer during initialization, get rid of all bad pieces;
2), set up empty logical mappings table during initialization, scan N AND Flash storer adds the physical block number that has logical number in the corresponding list item of logical mappings table, and it is empty that all the other logical mappings table list items keep;
3), set up empty physical block table and list index during initialization, scan N AND Flash storer will not have the piece of the physical block of logical number number to add in the sky physical block table;
4), set up rubbish piece table and list index during initialization, scan N AND Flash storer number adds the piece that is labeled as invalid physical block in the rubbish piece table to;
5), when writing the sky logical block, from empty physical block table, get an empty physical block and add in the logical block list item, again data are write in the new physical block;
When 6), revising logical block data, reading logical block corresponding physical blocks of data makes an amendment to buffer memory, get an empty physical block then and add in the same logical block list item from empty physical block table, write in the new physical block data cached, old physical block is labeled as invalid being put in the rubbish piece table;
7), adopt the specifically defined differentiation dirty data of the user octet of redundant area, promptly definition of data record start and end mark mark whether to occur in pairs judging according to two; Dirty data is marked as invalid and is recovered.
Adopt timing or free time to reclaim the rubbish piece, directly from rubbish piece table, get invalid physical block during recovery, then erase block; Upgrade empty physical block table simultaneously, rubbish piece of every recovery increases an empty physical block at empty physical block table.
If the rubbish number of blocks is not 0, then rubbish piece list index points to first rubbish piece in the rubbish piece table; Empty physical block list index points to first sky physical block in the empty physical block table.
The empty physical block that remains some is as backup, and is not empty to guarantee empty physical block table, and the logical mappings table can keep rolling.
The concrete course of work of present embodiment is:
1. definition redundancy bytes: as table 1, byte 2 is made the START mark, writes the initial moment record of a page data in NAND Flash at every turn, byte 3 is made the END mark, the finish time, the integrality of record data can be checked like this in record, differentiates the dirty data that power down produces; Byte 4 is made the INVALID mark, and writing discarded then the keeping a record of failure or this blocks of data becomes the rubbish piece, and waiting to reclaim becomes the sky data block after wiping; The piece that byte 5 marks damage; Byte 6,7 is deposited the logical number of piece.Byte 0～3rd in the table 1, self-defined byte, and all the other bytes are by standard definition.
Table 1 is a redundant area byte definition list:
| Byte number | Numerical value | Function | Explanation |
| 0～1 | XXXX | The data recording time | The write time of each blocks of data of mark |
| 2 | 0xF0 | Data recording start mark (START) | Be used for the processing of dirty data |
| 3 | 0x0F | Data recording end mark (END) | Be used for the processing of dirty data |
| 4 | 0 | Data invalid flag (INVALID) | Standard definition |
| 5 | Non-0xFF | Bad piece mark (BAD) | Standard definition |
| 6～7 | The logical number 1 of piece | Standard definition | |
| 8～10 | The back 256 byte ECC verifications and | Standard definition | |
| 11～12 | The logical number 2 of piece | Standard definition | |
| 13～15 | Preceding 256 byte ECC verifications and | Standard definition |
Table 1
2. definition list and parameter:
(1) definition logical mappings table, initial value equals empty (0xFFFF);
(2) the empty physical block table of definition is deposited the piece number of sky physical block in the table, initial value equals empty (0xFFFF);
(3) definition rubbish piece table is deposited the piece number of rubbish piece in the table, initial value equals empty (0xFFFF);
(4) definition empty reason number of blocks, initial value equals 0;
(5) definition rubbish number of blocks, initial value equals 0;
(6) the empty physical block list index of definition, initial position points to first list item of empty physical block table;
(7) definition rubbish piece list index, initial position points to first list item of rubbish piece table;
(8) definition physical block number pointer, initial position points to first physical block of NAND Flash;
3. set up the logical mappings table: scan N AND Flash during initialization, after getting rid of bad piece, rubbish piece and dirty data piece, read the logical number of each physical block, the piece that logical number is arranged is added in the logical mappings table, and empty physical block is not temporarily distributed logic number.
4. set up empty physical block table: set up empty physical block table during initialization.As Fig. 1, at first read the redundancy bytes of the NAND Flash physical block of physical block number pointed, after getting rid of bad piece, rubbish piece and dirty data piece, judge the logical number of physical block: if logical number sky then find an empty physical block, give first sky list item that calculates backward from the position that empty physical block list index points in the empty physical block table number tax of this piece, and empty reason number of blocks increases 1; If the logical number non-NULL, then the physical block number pointer increases the next physical block of 1 sensing and continues searching, repeats said process, finishes the scanning of NAND Flash device one week up to circulation.
Empty physical block table was set up or renewal after operation was finished, and empty physical block list index points to first available empty physical block, and the physical block number pointed is scanning position next time.
5. set up rubbish piece table: set up rubbish piece table during initialization, this process can combine enforcement with the foundation of empty physical block table.After getting rid of bad piece, at first read the redundancy bytes 4 of the NAND Flash physical block of physical block number pointed, if INVALID mark, then find a rubbish piece, give first sky list item that calculates backward from the position that rubbish piece list index points in the rubbish piece table number tax of this piece, and the rubbish number of blocks increases 1; If the non-INVALID piece of physical block, then the physical block number pointer increases the next physical block of 1 sensing and continues searching, repeats said process, finishes the scanning of NAND Flash device one week up to circulation.
6. write the operation of sky logical block: as Fig. 2, when logical block is carried out write operation, if the list item sky of this logical block in the logical mappings table, then directly in empty physical block table, the empty physical block number taking-up of empty physical block list index sensing is write in the list item of the logical mappings table that will operate, the list item of empty reason table is write as the sky mark, empty physical block list index increases 1 simultaneously, point to next position, empty reason number of blocks subtracts 1, then with the redundant area of logical block number (LBN) mark to the empty physical block that has just found, write this physical block afterwards, the end operation process; If the list item non-NULL of this logical block in the logical mappings table then was equivalent to revise a logical block when logical block was carried out write operation, then entered for the 7th step---revise data and upgrade rubbish piece table.
7. revise data and upgrade rubbish piece table: as Fig. 3, when being made amendment, the data of logical block earlier all data in this logical block corresponding physical piece are read buffer area, after having revised the data of buffer area, the process of execution graph 2 is looked for an empty physical block, the buffer area data are written back in the new-found empty physical block, it is invalid then old physical block to be labeled as, and this piece number added first sky list item that calculate backward the position of the initial pointed of rubbish piece of rubbish piece table, the rubbish number of blocks adds 1.This step is finished the filling of rubbish piece table in data modification.
8. reclaim the rubbish piece and upgrade empty physical block table: during garbage reclamation directly to the table handling of rubbish piece, empty piece of corresponding increase in the empty physical block table of invalid block of every recovery.As Fig. 4, at first judge the quantity of rubbish piece in the rubbish piece table, if 0 does not have the rubbish piece, finish; If the rubbish number of blocks is not 0, then in rubbish piece table, read an invalid physical block number from the list item position that rubbish piece list index points to, and write this list item as sky 0xFFFF, wipe invalid physical block then, next step adds in the sky physical block table this physical block number to calculate backward from the position that empty physical block list index points to first sky list item, and empty reason number of blocks increases 1, and the initial pointer of rubbish piece adds 1, point to the next position, the rubbish number of blocks subtracts 1 simultaneously.Repeating said process is 0 up to the rubbish number of blocks, reclaims and finishes.
9. when the differentiation of dirty data: NANDFlash uses in embedded device owing to reasons such as power down suddenly with obliterated data, produce the dirty data piece.This algorithm can be differentiated dirty data and do corresponding processing.
The differentiation of dirty data utilizes redundant area byte 2 and 3 to realize.According to the definition of table 1, byte 2 is data recording start marks, when beginning to the continuous write data of certain one page, earlier byte 2 is labeled as START, and then begins writing of a page data, and finish verification and the mark of ECC, again redundant area byte 3 is labeled as END at last, the expression complete operation.If in writing the process of page data, cause that for a certain reason system operation stops, redundant area byte 3 will not have the end of record (EOR) mark, and the data of this moment will be considered to dirty data.As long as, just can realize the differentiation of dirty data so in software, read the value of redundancy bytes 2 and 3.Differentiation and processing can be labeled as INVALID with this piece afterwards and be recovered.
The generation of dirty data may cause that file layout damages, and this algorithm owing to write is afterwards earlier wiped, and can simply judge and recovers old data according to the time of mark, avoids this problem.
Claims (6)
1. the dynamic management approach of a NAND Flash storer, it is characterized in that: described dynamic management approach may further comprise the steps:
1), detect NAND Flash storer during initialization, get rid of all bad pieces;
2), set up empty logical mappings table during initialization, scan N AND Flash storer adds the physical block number that has logical number in the corresponding list item of logical mappings table, and it is empty that all the other logical mappings table list items keep;
3), set up empty physical block table and list index during initialization, scan N AND Flash storer will not have the piece of the physical block of logical number number to add in the sky physical block table;
4), set up rubbish piece table and list index during initialization, scan N AND Flash storer number adds the piece that is labeled as invalid physical block in the rubbish piece table to;
5), when writing the sky logical block, from empty physical block table, get an empty physical block and add in the logical block list item, again data are write in the new physical block;
When 6), revising logical block data, reading logical block corresponding physical blocks of data makes an amendment to buffer memory, get an empty physical block then and add in the same logical block list item from empty physical block table, write in the new physical block data cached, old physical block is labeled as invalid being put in the rubbish piece table.
2. the dynamic management approach of a kind of NAND Flash storer as claimed in claim 1 is characterized in that: described dynamic management approach is further comprising the steps of:
7), adopt the specifically defined differentiation dirty data of the user octet of redundant area, promptly definition of data record start and end mark mark whether to occur in pairs judging according to two; Dirty data is marked as invalid and is recovered.
3. the dynamic management approach of a kind of NAND Flash storer as claimed in claim 1 or 2 is characterized in that: timing or free time are reclaimed the rubbish piece, directly get invalid physical block from rubbish piece table during recovery, then erase block; Upgrade empty physical block table simultaneously, rubbish piece of every recovery increases an empty physical block at empty physical block table.
4. the dynamic management approach of a kind of NAND Flash storer as claimed in claim 3 is characterized in that: if the rubbish number of blocks is not 0, then rubbish piece list index points to first rubbish piece in the rubbish piece table; Empty physical block list index points to first sky physical block in the empty physical block table.
5. the dynamic management approach of a kind of NAND Flash storer as claimed in claim 1 or 2 is characterized in that: keep the empty physical block of backup.
6. the dynamic management approach of a kind of NAND Flash storer as claimed in claim 3 is characterized in that: keep the empty physical block of backup.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101645526A CN100565477C (en) | 2007-12-06 | 2007-12-06 | A kind of dynamic management approach of NAND Flash storer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101645526A CN100565477C (en) | 2007-12-06 | 2007-12-06 | A kind of dynamic management approach of NAND Flash storer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101178689A true CN101178689A (en) | 2008-05-14 |
| CN100565477C CN100565477C (en) | 2009-12-02 |
Family
ID=39404949
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007101645526A Expired - Fee Related CN100565477C (en) | 2007-12-06 | 2007-12-06 | A kind of dynamic management approach of NAND Flash storer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100565477C (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011023121A1 (en) * | 2009-08-28 | 2011-03-03 | 炬才微电子（深圳）有限公司 | Method and device for allocating secondary memory |
| CN102163179A (en) * | 2010-02-16 | 2011-08-24 | 株式会社东芝 | Semiconductor memory device |
| CN102455665A (en) * | 2010-11-01 | 2012-05-16 | 纬创资通股份有限公司 | Electronic system, service life management circuit and service life management method |
| CN101393537B (en) * | 2008-09-18 | 2012-06-27 | 北京中星微电子有限公司 | NandFlash amortization management method |
| WO2012083754A1 (en) * | 2011-10-20 | 2012-06-28 | 华为技术有限公司 | Method and device for processing dirty data |
| CN102792284A (en) * | 2009-12-30 | 2012-11-21 | 辉达公司 | Memory device wear-leveling techniques |
| CN101740110B (en) * | 2009-12-17 | 2013-06-12 | 中兴通讯股份有限公司 | Method and device for erasure balance of Nand Flash |
| CN103258044A (en) * | 2013-05-24 | 2013-08-21 | 北京航天自动控制研究所 | Two-tuple NANDFLASH data file management method oriented to DSP |
| CN103678141A (en) * | 2012-09-05 | 2014-03-26 | 深圳市中兴移动通信有限公司 | Management method and management system for flash memory |
| CN103902411A (en) * | 2012-12-31 | 2014-07-02 | 杨威锋 | Technology for separating and preserving basic management information of high-reliability solid state storage equipment |
| CN105183397A (en) * | 2015-09-22 | 2015-12-23 | Tcl移动通信科技（宁波）有限公司 | EMMC read-write control method and system |
| CN105740162A (en) * | 2015-12-31 | 2016-07-06 | 上海盈方微电子有限公司 | NFTL data storage system and method applied to NAND flash |
| CN105760313A (en) * | 2015-08-07 | 2016-07-13 | 深圳市证通金信科技有限公司 | Data processing method and device for SPI-Flash-based (Serial Peripheral Interface-Flash-based) file system |
| CN106610900A (en) * | 2015-10-22 | 2017-05-03 | 蜂巢数据有限公司 | Eliminating garbage collection in NAND flash devices |
| CN106844583A (en) * | 2017-01-10 | 2017-06-13 | 厦门雅迅网络股份有限公司 | A kind of optimization method that FAT file system is set up on NOR Flash |
| CN107329905A (en) * | 2012-09-05 | 2017-11-07 | 慧荣科技股份有限公司 | Data storage device and flash memory control method |
| CN107506148A (en) * | 2017-08-29 | 2017-12-22 | 郑州云海信息技术有限公司 | The method and apparatus that a kind of solid state hard disc dummy block is abandoned |
| CN108255740A (en) * | 2017-12-07 | 2018-07-06 | 深圳市中易通安全芯科技有限公司 | A kind of FLASH equilibriums erasing-writing method and system |
| CN109407963A (en) * | 2017-08-15 | 2019-03-01 | 深圳市中兴微电子技术有限公司 | A kind of method and device for realizing storage management |
| CN112612418A (en) * | 2020-12-25 | 2021-04-06 | 航天信息股份有限公司 | Method and system for managing large-capacity NandFlash bad blocks |
| CN113391755A (en) * | 2020-02-26 | 2021-09-14 | 北京君正集成电路股份有限公司 | Method for dynamically associating physical erase blocks in parallel double-slice NAND FLASH |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103871447B (en) * | 2012-12-14 | 2017-03-01 | 华邦电子股份有限公司 | NAND gate flash memory array and chip and its access, reading and management method |
| CN104063186B (en) * | 2014-06-30 | 2016-04-06 | 成都万维图新信息技术有限公司 | A kind of data access method of electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1932778A (en) * | 2006-07-23 | 2007-03-21 | 海信集团有限公司 | Method for conducting virtual space management to NAND FLASH memory |
-
2007
- 2007-12-06 CN CNB2007101645526A patent/CN100565477C/en not_active Expired - Fee Related
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101393537B (en) * | 2008-09-18 | 2012-06-27 | 北京中星微电子有限公司 | NandFlash amortization management method |
| WO2011023121A1 (en) * | 2009-08-28 | 2011-03-03 | 炬才微电子（深圳）有限公司 | Method and device for allocating secondary memory |
| US9047186B2 (en) | 2009-08-28 | 2015-06-02 | Artek Microelectronics Co., Ltd. | Allocation method and apparatus of moderate memory |
| CN101740110B (en) * | 2009-12-17 | 2013-06-12 | 中兴通讯股份有限公司 | Method and device for erasure balance of Nand Flash |
| CN102792284A (en) * | 2009-12-30 | 2012-11-21 | 辉达公司 | Memory device wear-leveling techniques |
| CN102792284B (en) * | 2009-12-30 | 2016-05-04 | 辉达公司 | Memory devices loss equalization technology |
| CN102163179B (en) * | 2010-02-16 | 2015-05-06 | 株式会社东芝 | Semiconductor memory device |
| CN102163179A (en) * | 2010-02-16 | 2011-08-24 | 株式会社东芝 | Semiconductor memory device |
| CN102455665A (en) * | 2010-11-01 | 2012-05-16 | 纬创资通股份有限公司 | Electronic system, service life management circuit and service life management method |
| WO2012083754A1 (en) * | 2011-10-20 | 2012-06-28 | 华为技术有限公司 | Method and device for processing dirty data |
| CN103678141A (en) * | 2012-09-05 | 2014-03-26 | 深圳市中兴移动通信有限公司 | Management method and management system for flash memory |
| CN107329905A (en) * | 2012-09-05 | 2017-11-07 | 慧荣科技股份有限公司 | Data storage device and flash memory control method |
| CN103678141B (en) * | 2012-09-05 | 2017-11-28 | 努比亚技术有限公司 | The management method and management system of flash memory |
| CN103902411A (en) * | 2012-12-31 | 2014-07-02 | 杨威锋 | Technology for separating and preserving basic management information of high-reliability solid state storage equipment |
| CN103258044A (en) * | 2013-05-24 | 2013-08-21 | 北京航天自动控制研究所 | Two-tuple NANDFLASH data file management method oriented to DSP |
| CN103258044B (en) * | 2013-05-24 | 2017-01-18 | 北京航天自动控制研究所 | Two-tuple NANDFLASH data file management method oriented to DSP |
| CN105760313A (en) * | 2015-08-07 | 2016-07-13 | 深圳市证通金信科技有限公司 | Data processing method and device for SPI-Flash-based (Serial Peripheral Interface-Flash-based) file system |
| CN105183397A (en) * | 2015-09-22 | 2015-12-23 | Tcl移动通信科技（宁波）有限公司 | EMMC read-write control method and system |
| CN106610900A (en) * | 2015-10-22 | 2017-05-03 | 蜂巢数据有限公司 | Eliminating garbage collection in NAND flash devices |
| CN105740162A (en) * | 2015-12-31 | 2016-07-06 | 上海盈方微电子有限公司 | NFTL data storage system and method applied to NAND flash |
| CN105740162B (en) * | 2015-12-31 | 2018-08-07 | 上海盈方微电子有限公司 | NFTL data-storage systems and method applied to nand memory |
| CN106844583A (en) * | 2017-01-10 | 2017-06-13 | 厦门雅迅网络股份有限公司 | A kind of optimization method that FAT file system is set up on NOR Flash |
| CN106844583B (en) * | 2017-01-10 | 2022-03-25 | 厦门雅迅网络股份有限公司 | Optimization method for establishing FAT file system on NOR Flash |
| CN109407963A (en) * | 2017-08-15 | 2019-03-01 | 深圳市中兴微电子技术有限公司 | A kind of method and device for realizing storage management |
| CN107506148A (en) * | 2017-08-29 | 2017-12-22 | 郑州云海信息技术有限公司 | The method and apparatus that a kind of solid state hard disc dummy block is abandoned |
| CN107506148B (en) * | 2017-08-29 | 2020-03-24 | 郑州云海信息技术有限公司 | Method and device for discarding virtual blocks of solid state disk |
| CN108255740A (en) * | 2017-12-07 | 2018-07-06 | 深圳市中易通安全芯科技有限公司 | A kind of FLASH equilibriums erasing-writing method and system |
| CN113391755A (en) * | 2020-02-26 | 2021-09-14 | 北京君正集成电路股份有限公司 | Method for dynamically associating physical erase blocks in parallel double-slice NAND FLASH |
| CN113391755B (en) * | 2020-02-26 | 2023-09-22 | 北京君正集成电路股份有限公司 | Method for dynamically associating physical erase blocks in parallel double-sheet NAND FLASH |
| CN112612418A (en) * | 2020-12-25 | 2021-04-06 | 航天信息股份有限公司 | Method and system for managing large-capacity NandFlash bad blocks |
| CN112612418B (en) * | 2020-12-25 | 2024-03-08 | 航天信息股份有限公司 | Method and system for managing large-capacity NandFlash bad blocks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100565477C (en) | 2009-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100565477C (en) | A kind of dynamic management approach of NAND Flash storer | |
| CN101425041B (en) | Optimizing method for establishing FAT file systems on NAND FLASH memory | |
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| CN101169751B (en) | System with flash memory device and data recovery method thereof | |
| CN101236789B (en) | Method and apparatus for detecting static data area, wear-leveling, and merging data units | |
| CN101980177B (en) | Method and device for operating Flash | |
| CN102012867B (en) | Data storage system | |
| CN103150258B (en) | Writing, reading and garbage collection method of solid-state memory system | |
| CN102667739B (en) | Storage device management device and method for managing storage device | |
| CN101740110B (en) | Method and device for erasure balance of Nand Flash | |
| CN100426259C (en) | Virtual access method of storage document data | |
| CN102779096B (en) | Page, block and face-based three-dimensional flash memory address mapping method | |
| CN100449549C (en) | Method for building file systems on NAND flash memory in embedded system | |
| CN101925884A (en) | Increasing spare space in memory to extend lifetime of memory | |
| CN100501868C (en) | Method for realizing memory file system based on NAND Flash | |
| CN104268094A (en) | Optimized flash memory address mapping method | |
| CN106776376B (en) | Buffer storage supervisory method, memorizer control circuit unit and storage device | |
| CN101241471A (en) | Flash memory system and garbage collection method thereof | |
| CN102737715B (en) | For the method for power fail safeguard of data of NOR flash memory | |
| CN104794070A (en) | Solid-state flash memory write cache system and method based on dynamic non-covering RAID technology | |
| CN100533408C (en) | Flashmemory safety read-write method | |
| CN101552032A (en) | Method and device for constructing a high-speed solid state memory disc by using higher-capacity DRAM to join in flash memory medium management | |
| CN101673245A (en) | Information processing device including memory management device and memory management method | |
| CN102449607A (en) | Storage system provided with a plurality of flash packages | |
| CN102163175A (en) | Hybrid address mapping method based on locality analysis |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: HANGZHOU NENGLIAN TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: ZHEJIANG UNIVERSITY OF SCIENCE AND TECHNOLOGY Effective date: 20120530 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 310023 HANGZHOU, ZHEJIANG PROVINCE TO: 310012 HANGZHOU, ZHEJIANG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20120530 Address after: Hangzhou City, Zhejiang province 310012 Xihu District cypress Road No. 7 e-commerce Industrial Park 411 Patentee after: Hangzhou Nenglian Science & Technology Co., Ltd. Address before: 310023 Xihu District, Zhejiang Province, and the left road, No. 318, Patentee before: Zhejiang University of Science and Technology |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Hangzhou Nenglian Science & Technology Co., Ltd. Document name: Notification of Termination of Patent Right |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091202 Termination date: 20161206 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |