Scheduling of housekeeping operations in flash memory systems

• US 20060161724A1
• Filed: 01/20/2005
• Published: 07/20/2006
• Est. Priority Date: 01/20/2005
• Status: Abandoned Application

• Current Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Original Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Inventors: Tomlin, Andrew, Gorobets, Sergey A., Bennett, Alan D., Schroter, Charles
• Application Number:
  US11/040,325
• Publication Number:
  US 20060161724A1
• Time in Patent Office: Days
• US Class Current: 711/103
• CPC Class Codes: G06F 12/0246 in block erasable memory, e.g. flash memory
• CPC Class Codes: G06F 2212/1036 Life time enhancement
• CPC Class Codes: G06F 2212/7205 Cleaning, compaction, garbage collection, erase control
• CPC Class Codes: G06F 2212/7211 Wear leveling

Abstract

A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

Claims

1. A method of operating an erasable and re-programmable non-volatile memory system, which comprises, in response to receiving a command from outside the memory system having a time budget for its execution:

perform any function necessary to execute the command,

assert a busy signal outside of the memory system for a time extending beyond that utilized to perform said any necessary function while remaining within the time budget, and

perform during the extended busy signal time at least one housekeeping operation within the memory system that is unnecessary to execute the received command.

2. The method of claim 1, wherein the received command includes a write command followed by one or more units of data to be written into the memory system.

3. The method of claim 2, wherein a plurality of units of data to be written into the memory system are received, and wherein the busy signal is asserted in at least two intervals between receipt the units of data, during which time said at least one housekeeping operation is performed.

4. The method of claim 3, wherein said at least one housekeeping operation is performed during more than one of said at least two intervals.

5. The method of claim 4, wherein said any function necessary to execute the command includes a garbage collection operation and writing the received data to the memory system.

6. The method of claim 1, wherein said at least one housekeeping operation includes a wear leveling operation performed in a portion of the memory not involved in the execution of the command.

7. The method of claim 1, wherein said at least one housekeeping operation includes refreshing data stored in a portion of the memory not involved in the execution of the command.

8. The method of claim 1, wherein said at least one housekeeping operation includes a garbage collection operation performed in a portion of the memory not involved in the execution of the command.

9. A method of operating an erasable and re-programmable non-volatile memory system, comprising, in response to receiving a command to write one or more units of data within a given time budget:

determining whether any housekeeping operation is necessary to be able to write the one or more units of data,

if any housekeeping operation is necessary to be able to write the one or more units of data, performing at least the necessary housekeeping operation,

determining whether any remaining time within the time budget is sufficient for performing another housekeeping operation not necessary to be able to write the one or more units of data,

if sufficient time remains within the time budget, performing at least said another housekeeping operation during execution of the received command, and

writing the one or more units of data within the given time budget.

10. The method of claim 9, wherein determining whether any housekeeping operation is necessary to be able to write the one or more units of data includes determining whether data within two or more locations of the memory need to be consolidated into a single location, and, if so, consolidating such data within the given time budget.

11. The method of claim 9, wherein determining whether any remaining time within the time budget is sufficient for performing another housekeeping operation includes determining that sufficient time remains for a wear leveling exchange, and wherein performing at least said another housekeeping operation includes performing the wear leveling exchange within the given time budget.

12. The method of claim 9, wherein determining whether any remaining time within the time budget is sufficient for performing another housekeeping operation includes determining that sufficient time remains for refreshing data stored in a portion of the memory system different than a portion involved in executing the received write command, and wherein performing at least said another housekeeping operation includes refreshing such data within the given time budget.

13. The method of claim 9, wherein determining whether any remaining time within the time budget is sufficient for performing another housekeeping operation includes determining that sufficient time remains for performing garbage collection in a portion of the memory system different than a portion involved in executing the received write command, and thereafter performing such garbage collection.

14. The method of claim 9, additionally comprising receiving two or more units of data in succession, and wherein determining any remaining amounts of time within the time budget for performing another housekeeping operation results in determining that sufficient time remains, and additionally comprises asserting at least one busy period that is unnecessary to complete execution of the write command.

15. A method of operating a system of erasable and re-programmable non-volatile memory cells organized into a plurality of physical blocks of a number of memory cells that are simultaneously erasable and wherein data within logical group addresses are mapped into the physical blocks, comprising in response to receiving a command to write data to one of the logical groups and the data to be written:

determining whether data within the logical group is mapped to more than one of the physical blocks,

determining whether there is a wear leveling exchange pending between two of the plurality of blocks, and

(a) if data within the logical group are mapped to more than one of the physical blocks,

consolidating the data of the more than one of the physical blocks into a single block, and

writing the received data to an update block associated with the logical group, or

(b) if data within the logical group are not mapped to more than one of the physical blocks but there is a wear leveling exchange pending,

performing a wear leveling exchange between said two of the physical blocks, and

writing the received data to an update block associated with the logical group.

16. A method of operating a system of erasable and re-programmable non-volatile memory cells organized into a plurality of physical blocks of a number of memory cells that are simultaneously erasable and wherein incoming data within logical group addresses mapped to one of the physical blocks are programmed into an update physical block logically linked to said one block, comprising in response to receiving a write command and data to be written:

determining whether an update block is available to receive the data to be written,

(a) if an update block is not available,

consolidating data of one of a plurality of update blocks with data of a physical block to which data of the update block are logically linked, thereby making an update block available, and

thereafter writing data to the available update block, or

(b) if an update block is available,

performing a wear leveling exchange of data between two of the physical blocks, and

thereafter writing data to the available update block.