CN101510445B - Method and apparatus for storing and reading bad block meter of memory - Google Patents
Method and apparatus for storing and reading bad block meter of memory Download PDFInfo
- Publication number
- CN101510445B CN101510445B CN2009100801193A CN200910080119A CN101510445B CN 101510445 B CN101510445 B CN 101510445B CN 2009100801193 A CN2009100801193 A CN 2009100801193A CN 200910080119 A CN200910080119 A CN 200910080119A CN 101510445 B CN101510445 B CN 101510445B
- Authority
- CN
- China
- Prior art keywords
- bad block
- block table
- bad
- storer
- piece
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Techniques For Improving Reliability Of Storages (AREA)
- Read Only Memory (AREA)
Abstract
The invention provides a memory bad block table storing and reading method and a device thereof, relating to the memory field. The storing method of the memory bad block table is as follows: whether each block of the memory is bad is determined and a determination result is generated; if the block is determined to be a bad one, bad block information is generated; a preset number of good blocks are searched from the memory and taken as bad block table storing blocks; a bad block table is generated according to the bad block information and the identifier of the bad block table storing blocks; and at least one bad block table is written into the bad block table storing block. The memory bad block table reading method is as follows: the bad block table storing blocks are searched in the memory according to the identifier of the bad block table storing blocks; and the bad block table is read from the searched bad block table storing blocks. The invention can improve the application reliability of the memory.
Description
Technical field
The present invention relates to memory area, be meant a kind of memory bad block table storing method and device especially.
Background technology
Storer is used very extensive in electronic product, so the bad block management of storer is also extremely important.With NAND flash (flash memory) is example, and the management method of existing bad piece of NAND flash is that bad block table (BBT, Bad Block Table) is stored in NAND flash front or several block (piece) at the back.Usually, the position of the piece of storage bad block table is fixed, and is generally top several or rearmost several of storer.And the quantity of the piece of storage bad block table is also fixed, and is generally 4.In case so several of storer front or back all out of joint, the place of then depositing bad block table is just bad.Even NAND flash is formatd, system still can be created in bad block table the place of bad piece, after the system start-up, on the foremost of NAND flash or rearmost, searches bad block table, and the data of the bad block table that reads during use will be wrong.Because system's reading or writing to the data on the NAND flash; All to pass through the screening of bad block table; In case the data of bad block table are made mistakes, all there is the hidden danger of makeing mistakes in the data that will cause reading and writing on the NAND flash, and have therefore reduced the dependability of NAND flash.
Summary of the invention
The technical matters that the present invention will solve provides a kind of storage of bad block meter of memory and method that reads and device, can improve the reliability that storer uses.
For solving the problems of the technologies described above, embodiments of the invention provide technical scheme following:
On the one hand, a kind of memory bad block table storing method is provided, comprises:
Whether each piece of judging storer is bad piece, produces judged result;
If said judged result is: said is bad piece, then generates bad block message;
The good piece of in said storer, searching predetermined quantity is as bad block table storing blocks;
Identifier according to said bad block message and bad block table storing blocks generates bad block table;
At least a said bad block table is write in the said bad block table storing blocks.
Described memory bad block table storing method also comprises:
According to said judged result, calculate bad number of blocks;
According to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, said bad number of blocks and the said storer, calculate the quantity of the piece that has used in the said storer;
The quantity of the piece that has used in the said storer is recorded in the said bad block table.
Before the step of the quantity of the piece that has used in the said storer of said calculating, also comprise:
According to said bad block message, confirm the quantity of bad block table reservation storage block in the said storer.
In said storer, search before the step of good piece as bad block table storing blocks of predetermined quantity, also comprise:
According to said bad block message, confirm the backup quantity of bad block table;
According to the backup quantity of said bad block table, confirm said predetermined quantity;
The step that said identifier according to said bad block message and bad block table storing blocks generates bad block table is specially:
Generate bad block table according to the identifier of said bad block message, bad block table storing blocks and the backup quantity of said bad block table.
Said the step that a at least said bad block table writes in the said bad block table storing blocks is specially:
The a said bad block table of storage in said bad block table storing blocks;
According to the backup quantity of said bad block table, the said bad block table of backup in said bad block table storing blocks.
Said storer is NAND flash, NOR flash or ROM.
On the other hand, a kind of memory bad block table storing device is provided, comprises:
Judge module is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module is used for if said judged result is: said is bad piece, then generates bad block message;
Search module, the good piece that is used for searching predetermined quantity at said storer is as bad block table storing blocks;
The bad block table generation module is used for generating bad block table according to the identifier of said bad block message and bad block table storing blocks;
Writing module is used for a at least said bad block table is write said bad block table storing blocks.
Described memory bad block table storing device also comprises:
First computing unit is used for calculating bad number of blocks according to said judged result;
Second computing unit is used for the quantity that the quantity according to bad block table storing blocks, said bad number of blocks and said storer bad block table are reserved storage block, calculates the quantity of the piece that has used in the said storer;
Record cell, the quantity of the piece that is used for said storer has been used is recorded in the said bad block table.
On the other hand, a kind of read method of bad block meter of memory is provided, comprises:
According to the identifier of bad block table storing blocks, from storer, search bad block table storing blocks;
From the said bad block table storing blocks that finds, read bad block table.
On the other hand, a kind of reading device of bad block meter of memory is provided, comprises:
Search module, be used for identifier, from storer, search bad block table storing blocks according to the storer bad block table storing blocks;
Read module is used for reading bad block table from the said bad block table storing blocks that finds.
Embodiments of the invention have following beneficial effect:
In the such scheme, judge whether each piece of storer is bad piece, produce judged result; If said judged result is: said is bad piece, then generates bad block message; The good piece of in said storer, searching predetermined quantity is as bad block table storing blocks; Identifier according to said bad block message and bad block table storing blocks generates bad block table; At least a said bad block table is write in the said bad block table storing blocks.Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, and when using storer, therefore the correctness of the bad block meter of memory data that guaranteed to read, has improved and make memory-aided reliability.
Description of drawings
Fig. 1 is the schematic flow sheet of memory bad block table storing method one embodiment of the present invention;
Fig. 2 is the schematic flow sheet of another embodiment of memory bad block table storing method of the present invention;
Fig. 3 is the structural representation of memory bad block table storing device one embodiment of the present invention;
Fig. 4 is the structural representation of another embodiment of memory bad block table storing device of the present invention;
Fig. 5 is the schematic flow sheet of the read method of bad block meter of memory of the present invention;
Fig. 6 is the structural representation of the reading device of bad block meter of memory of the present invention;
Fig. 7 is the schematic flow sheet of memory bad block table storing of the present invention with the application scenarios that reads.
Embodiment
For technical matters, technical scheme and advantage that embodiments of the invention will be solved is clearer, will combine accompanying drawing and specific embodiment to be described in detail below.
Embodiments of the invention provide a kind of memory bad block table storing and the method and the device that read to the low problem of storer dependability in the prior art.
As shown in Figure 1, the process flow diagram for memory bad block table storing method one embodiment of the present invention comprises:
101, judge whether each piece of storer is bad piece, produce judged result;
In this step, can be for successively from front to back or from back to front, each piece of swept memory judges whether each piece has been piece.
102, if said judged result is: said is bad piece, then generates bad block message;
In this step, after whole storer is accomplished in scanning, generate bad block message.
103, the good piece of in said storer, searching predetermined quantity is as bad block table storing blocks;
In this step, can search piece as bad block table storing blocks according to judged result.
104, according to the identifier generation bad block table of said bad block message and bad block table storing blocks;
105, a at least said bad block table is write in the said bad block table storing blocks.
In the said method, can be directed against the processing that new storer or firm formative storer are created bad block table.The good piece of in said storer, searching predetermined quantity is as bad block table storing blocks; Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, and when using storer, therefore the correctness of the bad block meter of memory data that guaranteed to read, has improved and make memory-aided reliability.
As shown in Figure 2, the process flow diagram for another embodiment of memory bad block table storing method of the present invention comprises:
201, judge whether each piece of storer is bad piece, produce judged result;
In this step, can be for successively from front to back or from back to front, each piece of swept memory judges whether each piece has been piece.
202, if said judged result is: said is bad piece, then generates bad block message;
In this step, after whole storer is accomplished in scanning, generate bad block message.
203, according to said bad block message, confirm the backup quantity of bad block table;
The backup of bad block table is used for piece when a bad block table of storage when breaking down, and can from other back up the piece of bad block table, obtain bad block table, and the information of bad block table can not lost, and has improved to make memory-aided reliability.The backup quantity of bad block table is many more, and the reliability of storer is high more.In addition, the backup quantity of bad block table is not fixed, and can confirm according to the bad block message of storer; When the bad piece of storer is many; The mass ratio that memory chip is described is relatively poor, for the piece that prevents to store a bad block table breaks down, the backup quantity of more bad block table can be set; When the bad piece of storer is fewer, explain that the mass ratio of memory chip is better, the backup quantity of less bad block table can be set.The backup quantity of bad block table is set according to the chip quality of storer like this, flexibly.
204, according to the backup quantity of said bad block table, confirm predetermined quantity;
Wherein, the predetermined quantity of bad block table storing blocks can be unfixed, can confirm according to the bad block message of storer, when the bad piece of storer is many, the number of more bad block table storing blocks can be set; When the bad piece of storer is fewer, the number of less bad block table storing blocks can be set.The quantity of bad block table storing blocks is set according to the chip quality of storer like this, flexibly.
205, the good piece of in said storer, searching predetermined quantity is as bad block table storing blocks;
Can find out by top step, not fix, can be provided with flexibly as required as the predetermined quantity of the good piece of bad block table storing blocks.According to judged result, searched piece as bad block table storing blocks.
206, generate bad block table according to the identifier of said bad block message, bad block table storing blocks and the backup quantity of said bad block table.
Wherein, bad block message is used for the bad piece situation of instruction memory.The identifier of bad block table storing blocks is used to indicate this piece for preserving the piece of bad block table, in follow-up, finds the preservation bad block table storing blocks according to the identifier of bad block table storing blocks.The backup quantity of said bad block table is used to indicate the backup quantity of bad block table, when the piece of preserving a bad block table breaks down, can also continue to search the piece that other preserve bad block table according to the backup quantity of bad block table.In addition, bad block table also comprises version number, is used for the bad block table of identification renewal.
207, a at least said bad block table is write in the said bad block table storing blocks.
Wherein, this step is specially:
2071, a said bad block table of storage in said bad block table storing blocks;
2072, according to the backup quantity of said bad block table, the said bad block table of backup in said bad block table storing blocks.
Wherein, bad block table can be recorded in first page of reserved area (spare area) of piece, if some storer, for example the reserved area of NAND flash is too small, can be recorded in the 2nd, 3 page reserved area.
208, according to said judged result, calculate bad number of blocks;
In this step, calculate the quantity of all the bad pieces in the storer.
209, according to said bad block message, confirm the quantity of said bad block table reservation storage block.
It is to be used for that bad block table is reserved storage block, and when the piece of preserving bad block table broke down, bad block table was reserved storage block and preserved bad block table as bad block table storing blocks, like this, makes on the piece that bad block table is kept at all the time.Wherein, the quantity that bad block table is reserved storage block can be unfixed, can confirm according to the bad block message of storer, when the bad piece of storer is many, the number that more bad block table is reserved storage block can be set; When the bad piece of storer is fewer, the number that less bad block table is reserved storage block can be set.Like this, the chip quality according to storer is provided with the quantity that bad block table is reserved storage block flexibly.
210, according to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, said bad number of blocks and the said storer, calculate the quantity of the piece that has used in the said storer;
The quantity of the piece that has used comprise storer bad number of blocks, preserve bad block table and the quantity of the piece that uses and be the summation of the quantity of preserving the bad block table reserved block, total the piece number of storer deducts the quantity that the quantity of the piece that has used is exactly the remaining block available of storer.
211, the quantity of the piece that has used in the said storer is recorded in the said bad block table.
Said storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM)).
In the foregoing description; The fixing preservation position of bad block table not; The also fixing preservation umber of bad block table not; And be not fixed for preserving the quantity of the reserved block of bad block table yet,, still can read the data of storer reliably even under the environment of more abominable storer slice, thin piece (for example all there is a sheet of continuous bad piece the front and back of storer).Do not store bad block table owing to there is to use fixing piece number; So even a lot of pieces in back have all been gone bad; The meeting of the piece of record bad block table pushes away forward automatically; Though make that like this free space of whole storer is few, can guarantee that bad block table has been recorded on the piece, can not make mistakes when making read-write memory.
As shown in Figure 3, the present invention provides a kind of memory bad block table storing device 3, comprising:
Bad block message generation module 32 is used for if said judged result is: said is bad piece, then generates bad block message;
Search module 33, the good piece that is used for searching predetermined quantity at said storer is as bad block table storing blocks;
Bad block table generation module 34 is used for generating bad block table according to the identifier of said bad block message and bad block table storing blocks;
Said storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM)).
In the such scheme, can be directed against the processing that new storer or firm formative storer are created bad block table.The good piece of in said storer, searching predetermined quantity is as bad block table storing blocks; Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, and when using storer, therefore the correctness of the bad block meter of memory data that guaranteed to read, has improved and make memory-aided reliability.
As shown in Figure 4, the present invention also provides a kind of memory bad block table storing device 3, comprising:
Bad block message generation module 32 is used for if said judged result is: said is bad piece, then generates bad block message;
Search module 33, the good piece that is used for searching predetermined quantity at said storer is as bad block table storing blocks;
Bad block table generation module 34 is used for generating bad block table according to the identifier of said bad block message and bad block table storing blocks;
In the such scheme; The quantity of the piece that has used comprise storer bad number of blocks, preserve bad block table and the quantity of the piece that uses and be the summation of the quantity of preserving the bad block table reserved block, total the piece number of storer deducts the quantity that the quantity of the piece that has used is exactly the remaining block available of storer.In the subsequent treatment, can know the quantity of the block available that storer is remaining according to the quantity of the piece that has used of storer.
As shown in Figure 5, the present invention provides a kind of read method of bad block meter of memory, comprising:
501, according to the identifier of bad block table storing blocks, from storer, search bad block table storing blocks;
In this step, during each system start-up, (also can the invention is not restricted to this in the past backward) from behind forward, find the piece of preserving bad block table according to the identifier of bad block table storing blocks.
502, from the said bad block table storing blocks that finds, read bad block table.
Said bad block table can comprise: the quantity of the piece that has used in the identifier of said bad block message, bad block table storing blocks, the storer.
In this step, from bad block table, read the quantity of the piece that has used in the storer, in the subsequent treatment, can calculate block available number remaining in the storer according to the quantity of the piece that has used.
Said storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM))
In the such scheme, when searching bad block meter of memory, be not fixed in and search top several or rearmost several of storer, but the piece in the storer is searched successively, till finding bad block table storing blocks.
As shown in Figure 6, the present invention provides a kind of reading device 6 of bad block meter of memory, comprising:
Read module 62 is used for reading bad block table from the said bad block table storing blocks that finds.
Said bad block table comprises: the quantity of the piece that has used in the identifier of said bad block message, bad block table storing blocks, the storer.In this scheme, from bad block table, read the quantity of the piece that has used in the storer, the quantity according to the piece that has used in the subsequent treatment can calculate remaining block available number.
In the such scheme, when searching bad block meter of memory, be not fixed in and search top several or rearmost several of storer, but the piece in the storer is searched successively, till finding bad block table storing blocks.
As shown in Figure 7, be the schematic flow sheet of storer in the system (is example with Nand flash) bad block table storing with the application scenarios that obtains, comprising:
701, elder generation's allocation space in internal memory is as the buffer zone of preserving bad block table information.
702, swept memory piece (the invention is not restricted to this, also swept memory piece) from front to back from back to front.
703, according to the identifier whether bad block table storing blocks is arranged, judge whether this piece is bad block table storing blocks.If then execution in step 704; If not, then execution in step 707.
704, find bad block table record block after, read the bad block table in the bad block table record block, and the buffer zone of the bad block table information of distributing before the data of the bad block table in this piece are covered.
705, from bad block table, read the piece number that has used.
706, memory-aided total block data deducts the piece number that has used, calculates the block available number of storer, and the block available number of this storer is passed to system.
707, call the fine or not state of judging this piece that drives.
708, judged result is recorded in the buffer zone of bad block table information.
709, judge whether to scan first, if for being that then execution in step 710; If, then return step 702, next piece is continued scanning for not.
710; If find first; Be much to seek bad piece record block, show that this is new storer or firm formative storer, according to the buffer zone of bad block table information from after search several good pieces forward and (the invention is not restricted to this; Also can search backward in the past), before be recorded in the buffer zone of bad block table information information write on these several good pieces of storer.
711, calculate the piece number that has used in the storer, write on these several good pieces of storer.
712, memory-aided total block data deducts the piece number that has used, obtains the block available number of storer, and the system that passes to uses with the block available number of this storer.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to accomplish through program; Described program can be stored in the read/write memory medium of a portable terminal; This program is when carrying out; Comprise step, described storage medium etc. like above-mentioned method embodiment.
The above is a preferred implementation of the present invention; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from principle according to the invention; Can also make some improvement and retouching, these improvement and retouching also should be regarded as protection scope of the present invention.
Claims (6)
1. a memory bad block table storing method is characterized in that, comprising:
Whether each piece of judging storer is bad piece, produces judged result;
If said judged result is: said is bad piece, then generates bad block message;
The good piece of in said storer, searching predetermined quantity is as bad block table storing blocks;
Identifier according to said bad block message and bad block table storing blocks generates bad block table;
At least a said bad block table is write in the said bad block table storing blocks;
Described memory bad block table storing method also comprises:
According to said judged result, calculate bad number of blocks;
According to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, said bad number of blocks and the said storer, calculate the quantity of the piece that has used in the said storer;
The quantity of the piece that has used in the said storer is recorded in the said bad block table.
2. memory bad block table storing method according to claim 1 is characterized in that, before the step of the quantity of the piece that has used in the said storer of said calculating, also comprises:
According to said bad block message, confirm the quantity of bad block table reservation storage block in the said storer.
3. memory bad block table storing method according to claim 1 is characterized in that,
In said storer, search before the step of good piece as bad block table storing blocks of predetermined quantity, also comprise:
According to said bad block message, confirm the backup quantity of bad block table;
According to the backup quantity of said bad block table, confirm said predetermined quantity;
The step that said identifier according to said bad block message and bad block table storing blocks generates bad block table is specially:
Generate bad block table according to the identifier of said bad block message, bad block table storing blocks and the backup quantity of said bad block table.
4. memory bad block table storing method according to claim 3 is characterized in that,
Said the step that a at least said bad block table writes in the said bad block table storing blocks is specially:
The a said bad block table of storage in said bad block table storing blocks;
According to the backup quantity of said bad block table, the said bad block table of backup in said bad block table storing blocks.
5. memory bad block table storing method according to claim 1 is characterized in that, said storer is NAND flash, NOR flash or ROM.
6. a memory bad block table storing device is characterized in that, comprising:
Judge module is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module is used for if said judged result is: said is bad piece, then generates bad block message;
Search module, the good piece that is used for searching predetermined quantity at said storer is as bad block table storing blocks;
The bad block table generation module is used for generating bad block table according to the identifier of said bad block message and bad block table storing blocks;
Writing module is used for a at least said bad block table is write said bad block table storing blocks;
Described memory bad block table storing device also comprises:
First computing unit is used for calculating bad number of blocks according to said judged result;
Second computing unit is used for the quantity that the quantity according to bad block table storing blocks, said bad number of blocks and said storer bad block table are reserved storage block, calculates the quantity of the piece that has used in the said storer;
Record cell, the quantity of the piece that is used for said storer has been used is recorded in the said bad block table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100801193A CN101510445B (en) | 2009-03-19 | 2009-03-19 | Method and apparatus for storing and reading bad block meter of memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100801193A CN101510445B (en) | 2009-03-19 | 2009-03-19 | Method and apparatus for storing and reading bad block meter of memory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101510445A CN101510445A (en) | 2009-08-19 |
| CN101510445B true CN101510445B (en) | 2012-11-21 |
Family
ID=41002807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100801193A Expired - Fee Related CN101510445B (en) | 2009-03-19 | 2009-03-19 | Method and apparatus for storing and reading bad block meter of memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101510445B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102063382B (en) * | 2009-11-12 | 2014-08-27 | 慧荣科技股份有限公司 | Data storage device, controller and method for accessing data in suborder memory |
| CN102253899A (en) * | 2011-07-28 | 2011-11-23 | 张岭 | Method for improving utilization efficiency of flash memory chip storage unit |
| CN103186471B (en) * | 2011-12-30 | 2016-10-12 | 深圳市共进电子股份有限公司 | The management method of bad block and system in storage device |
| CN102722443B (en) * | 2012-05-21 | 2014-12-17 | 三星半导体(中国)研究开发有限公司 | Bad block management method for flash memory |
| CN104461750B (en) * | 2013-09-25 | 2018-05-04 | 北京兆易创新科技股份有限公司 | A kind of access method and device of NAND flash |
| CN103593303A (en) * | 2013-10-29 | 2014-02-19 | 福建星网视易信息***有限公司 | Bad block table storage method and device and NAND gate nonvolatile memory |
| CN106486170B (en) * | 2016-09-06 | 2019-11-26 | 深圳忆数存储技术有限公司 | The potential bad block localization method and device of solid state hard disk |
| CN108614745A (en) * | 2016-12-09 | 2018-10-02 | 北京京存技术有限公司 | Manufacture bad block processing method based on NAND flash and NAND flash storage devices |
| CN107908500B (en) * | 2017-11-30 | 2021-02-26 | 新华三技术有限公司 | Bad block identification method and device |
| CN109582239B (en) * | 2018-12-03 | 2022-02-18 | 郑州云海信息技术有限公司 | SSD bad block table storage method, device, equipment and storage medium |
| CN116661694A (en) * | 2019-06-14 | 2023-08-29 | 北京忆芯科技有限公司 | Method and device for intelligently identifying unreliable blocks of nonvolatile storage medium |
| CN110287068B (en) * | 2019-07-04 | 2023-02-28 | 四川长虹空调有限公司 | NandFlash driving method |
| CN110471625B (en) * | 2019-08-15 | 2021-04-20 | 深圳忆联信息***有限公司 | Bad block information protection method and device, computer equipment and storage medium |
| CN110795044B (en) * | 2019-10-31 | 2023-04-11 | 深圳市友华通信技术有限公司 | Bad block management method and system of NAND Flash memory |
| CN113176970B (en) * | 2021-06-28 | 2021-10-22 | 中国核动力研究设计院 | System and method for managing bad blocks of nor flash based on FPGA |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1321314A (en) * | 1999-07-16 | 2001-11-07 | 皇家菲利浦电子有限公司 | Recording medium with write protected defect list |
| CN1636250A (en) * | 2002-02-19 | 2005-07-06 | 因芬尼昂技术股份公司 | Fuse concept and method of operation |
| CN1815455A (en) * | 2004-12-10 | 2006-08-09 | 普安科技股份有限公司 | Storage system and method for handling bad storage device data therefor |
| CN101283335A (en) * | 2005-10-07 | 2008-10-08 | 微软公司 | Flash memory management |
-
2009
- 2009-03-19 CN CN2009100801193A patent/CN101510445B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1321314A (en) * | 1999-07-16 | 2001-11-07 | 皇家菲利浦电子有限公司 | Recording medium with write protected defect list |
| CN1636250A (en) * | 2002-02-19 | 2005-07-06 | 因芬尼昂技术股份公司 | Fuse concept and method of operation |
| CN1815455A (en) * | 2004-12-10 | 2006-08-09 | 普安科技股份有限公司 | Storage system and method for handling bad storage device data therefor |
| CN101283335A (en) * | 2005-10-07 | 2008-10-08 | 微软公司 | Flash memory management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101510445A (en) | 2009-08-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101510445B (en) | Method and apparatus for storing and reading bad block meter of memory | |
| CN101369246B (en) | System and method for using a memory mapping function to map memory defects | |
| US8745443B2 (en) | Memory system | |
| CN101446921B (en) | Dynamic storage method of Flash memory | |
| KR940704028A (en) | METHOD FOR IMPROVING PARTIAL STRIPE WRITE PERFORMANCE IN DISK ARRAY SUBSYSTEMS | |
| CN103064760B (en) | Backup method and backup device | |
| CN102722443B (en) | Bad block management method for flash memory | |
| CN103608866A (en) | Data wiping method and device for flash memory | |
| CN106776362A (en) | The control method and device of memory | |
| CN109976673B (en) | Data writing method and device | |
| CN100433195C (en) | Flash memory medium data writing method | |
| CN108664208B (en) | File additional writing operation method and device based on FLASH memory | |
| CN110444243A (en) | Store test method, system and the storage medium of equipment read error error correcting capability | |
| CN112133357B (en) | eMMC test method and device | |
| CN107562766B (en) | Data file writing method, device and system | |
| CN102737716B (en) | Memorizer memory devices, Memory Controller and method for writing data | |
| CN113434476B (en) | Data synchronization method, device, equipment, system, storage medium and program product | |
| CN106875977A (en) | A kind of solid state hard disc adjustment method and device | |
| CN113918485B (en) | Method, device, equipment and storage medium for preventing flash memory data from being lost | |
| CN102479116A (en) | Method and device for viewing code information in system abnormality | |
| CN102375779A (en) | Data processing method and data processing module | |
| US8566562B2 (en) | Method for sequentially writing data with an offset to a non-volatile memory | |
| CN101751283A (en) | Virtual machine monitor, virtual machine system and client operation system state acquiring method | |
| CN106205737B (en) | A method of test Nand flash life cycle | |
| CN112331252A (en) | Method and device for automatically marking bad blocks of Nand flash memory, storage medium and terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: WUXI VIMICRO CORP. Free format text: FORMER OWNER: BEIJING ZHONGXING MICROELECTRONICS CO., LTD. Effective date: 20110602 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 15/F, SHINING BUILDING, NO. 35, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 214028 610, NATIONAL INTEGRATED CIRCUIT DESIGN PARK (CHUANGYUAN BUILDING), NO. 21-1, CHANGJIANG ROAD, WUXI NEW DISTRICT, JIANGSU PROVINCE, CHINA |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20110602 Address after: 214028 national integrated circuit design Park, 21-1 Changjiang Road, New District, Jiangsu, Wuxi, China, 610 Applicant after: Wuxi Vimicro Co., Ltd. Address before: 100083, Haidian District, Xueyuan Road, Beijing No. 35, Nanjing Ning building, 15 Floor Applicant before: Beijing Vimicro Corporation |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121121 Termination date: 20190319 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |