Corrected data storage and handling methods

• US 20060039196A1
• Filed: 10/18/2005
• Published: 02/23/2006
• Est. Priority Date: 10/03/2003
• Status: Active Grant

• Current Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Original Assignee: SanDisk Corporation (Western Digital Corporation)
• Inventors: Conley, Kevin M., Gonzalez, Carlos J., Gorobets, Sergey Anatolievich, Elhamias, Reuven
• Granted Patent: US 7,173,852 B2
• Time in Patent Office: Days
• US Class Current: 365/185.10
• CPC Class Codes: G06F 11/106 Correcting systematically all correctable errors, i.e. scrubbing
• CPC Class Codes: G06F 11/1068 in sector programmable memories, e.g. flash disk G06F11/1072 takes precedence
• CPC Class Codes: G11C 16/3418 Disturbance prevention or evaluation; Refreshing of disturbed memory data
• CPC Class Codes: G11C 16/3431 Circuits or methods to detect disturbed nonvolatile memory cells, e.g. which still read as programmed but with threshold less than the program verify threshold or read as erased but with threshold greater than the erase verify threshold, and to reverse the disturbance via a refreshing programming or erasing step
• CPC Class Codes: G11C 29/76 using address translation or modifications

Abstract

In order to maintain the integrity of data stored in a flash memory that are susceptible to being disturbed by operations in adjacent regions of the memory, disturb events cause the data to be read, corrected and re-written before becoming so corrupted that valid data cannot be recovered. The sometimes conflicting needs to maintain data integrity and system performance are balanced by deferring execution of some of the corrective action when the memory system has other high priority operations to perform. In a memory system utilizing very large units of erase, the corrective process is executed in a manner that is consistent with efficiently rewriting an amount of data much less than the capacity of a unit of erase. Data is rewritten when severe errors are found during read operations. Portions of data are corrected and copied within the time limit for read operation. Corrected portions are written to dedicated blocks.

Claims

1. A method of managing data in a non-volatile memory array having multiple blocks of non-volatile memory cells, a block being the minimum unit of erase, a block containing multiple sectors of data, comprising:

receiving a read command from a host specifying data to be read from a first block;

reading the data from the first block;

determining if one or more portions of the data are to be corrected and replaced in the non-volatile memory; and

when a portion of the data is to be corrected and replaced, storing a corrected version of the portion of the data in a second block but not replacing other portions of the data and not storing the other portions of the data in the second block.

2. The method of claim 1 further comprising subsequently copying the corrected version of the portion of the data and the other portions of the data together to a third block.

3. The method of claim 1 wherein the read command requires a corresponding read operation be performed within a time limit, the time limit being less than the time to copy an entire block.

4. The method of claim 1 wherein subsequently a read command is received identifying a logical address of the portion of data that is replaced, and the corrected version of the portion of data in the second block is sent to the host.

5. The method of claim 1 wherein the first block and the second block are both metablocks comprised of multiple erase blocks linked to be erased and written together.

6. The method of claim 1 wherein the portion of data is a sector.

7. The method of claim 1 wherein the portion of data is a page.

8. The method of claim 1 wherein the determining if one or more portions of the data are to be corrected includes the use of error correction code and the corrected version of the portion of the data is derived using error correction code.

9. A method of managing data in a memory system having a non-volatile memory array that includes multiple blocks, a block being the minimum unit of erase, comprising:

receiving a read command from a host identifying a plurality of sectors in a first block to be read within a predetermined time limit that is less than the time required to copy one block of the memory array;

reading the plurality of sectors from the first block and determining whether ones of the plurality of sectors are to be corrected and replaced;

if an individual sector is to be corrected and replaced, then correcting the individual sector and writing the corrected sector to a second block within the predetermined time limit;

maintaining sectors that are not to be corrected and replaced in the first block in uncorrected form without writing them to the second block;

sending the individual sector and the sectors that are not to be corrected and replaced to the host; and

subsequently copying the individual sector and the sectors that are not to be corrected and replaced to a third block.

10. The method of claim 9 further comprising correcting other sectors from the first block and writing the corrected other sectors to the second block with the individual sector within the time limit.

11. The method of claim 9 further comprising writing additional sectors to the second block, the additional sectors replacing sectors of data in one or more blocks of the memory array other than the first block;

and

subsequently compacting data in the second block by copying sectors in the second block that are not obsolete to a fourth block, but not copying sectors in the second block that are not obsolete to the fourth block.

12. The method of claim 11 wherein compacting occurs in response to a threshold number of sectors being stored in the second block.

13. The method of claim 12 wherein the threshold number of sectors is determined by the maximum amount of data that can be copied within a time limit for a read command.

14. The method of claim 9 further comprising subsequently reading only corrected copies of sectors having both a corrected copy and an uncorrected copy in the non-volatile memory array.

15. The method of claim 14 wherein a corrected copy of a sector is identified from a list of corrected and replaced sectors.

16. A method of managing data in a memory system having a non-volatile memory array that includes multiple blocks, a block being the minimum unit of erase, comprising:

identifying sectors of data to be corrected and replaced and writing corrected replacement sectors for only the identified sectors to a dedicated block, while leaving uncorrected sectors in original blocks with the identified sectors;

receiving updated sectors from a host, the updated sectors replacing sectors stored in the non-volatile memory array;

storing the updated sectors in the non-volatile memory;

subsequently receiving a read command from a host identifying a sector having a logical address for which a first corrected replacement sector exists in the dedicated block and for which a first updated sector exists in the non-volatile memory; and

sending the most recently written one of the first corrected replacement sector and the first updated sector to the host.

17. The method of claim 16 wherein the updated sectors are stored in update blocks and the first updated sector is stored in a first update block, an update block storing updated data within a logical address range corresponding to one or more original blocks.

18. The method of claim 17 wherein the first update block stores sectors in a logically non-sequential order.

19. A method of managing data in a non-volatile memory array having multiple blocks of non-volatile memory cells, a block being the minimum unit of erase, a block containing multiple addressable units of data, comprising:

reading data from a first block;

determining if one or more portions of the data are to be corrected and replaced in the non-volatile memory; and

when a portion of the data is to be corrected and replaced, storing a corrected version of the portion of the data in a second block but not replacing other portions of the data and not storing the other portions of the data in the second block.

20. The method of claim 19 wherein the corrected version of the portion of the data and the other portions of the data are later consolidated to a third block.

21. The method of claim 19 wherein the reading, the determining and storing of corrected versions of the one or more portions of the data are completed within a time limit.

22. The method of claim 21 wherein the reading is in response to a host read command and the time limit is a time limit for a read operation.

23. The method of claim 19 wherein the determining and the storing are part of a scrub operation.