Wear Leveling for Non-Volatile Memories: Maintenance of Experience Count and Passive Techniques

• US 20100174845A1
• Filed: 01/05/2009
• Published: 07/08/2010
• Est. Priority Date: 01/05/2009
• Status: Abandoned Application

• Current Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Original Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Inventors: Zilberman, Eugene, Gorobets, Sergey Anatolievich, So, Bum Suck
• Application Number:
  US12/348,819
• Publication Number:
  US 20100174845A1
• 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/7201 Logical to physical mapping or translation of blocks or pages
• CPC Class Codes: G06F 2212/7208 Multiple device management, e.g. distributing data over multiple flash devices
• CPC Class Codes: G06F 2212/7211 Wear leveling

Abstract

Wear leveling techniques for re-programmable non-volatile memory systems, such as a flash EEPROM system, are described. One set of techniques uses “passive” arrangements, where, when a blocks are selected for writing, blocks with relatively low experience count are selected. This can be done by ordering the list of available free blocks based on experience count, with the “coldest” blocks placed at the front of the list, or by searching the free blocks to find a block that is “cold enough”. In another, complementary set of techniques, usable for more standard wear leveling operations as well as for “passive” techniques and other applications where the experience count is needed, the experience count of a block or meta-block is maintained as a block'"'"'s attribute along its address in the data management structures, such as address tables.

Claims

1. A method of operating a non-volatile memory system including a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks and control circuitry managing the storage of data on the memory circuit, the method including:

selecting blocks to be written with data content from a list of free blocks;

returning blocks whose data content is obsolete to a pool of free blocks, where the list of free blocks formed from members of the pool of free blocks; and

ordering the list of free blocks in increasing order of the blocks'"'"' experience count, where when selecting a block from the free block list, the selection is made from the list according to the ordering.

2. The method of claim 1, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller forms multi-block logical structures spanning a corresponding number of sub-arrays, the multi-block logical structures being maintained in the free block list.

3. The method of claim 1, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and said ordering includes independently ordering the list of free blocks in each sub-array in increasing order of experience count, wherein said selecting blocks includes selecting a plurality of blocks from a corresponding number of sub-arrays and forming the plurality of blocks into a composite logical structure;

and wherein said returning blocks includes dissolving the composite logical structure.

4. The method of claim 1, wherein the memory circuit is formed of a binary memory section and a multi-state memory section and said ordering is only performed for the multi-state section of the memory.

5. The method of claim 1, wherein the memory system maintains the experience counts of the blocks as an attribute of the corresponding block that is associated with the blocks address.

6. The method of claim 1, wherein said selection is for a block in which to store user data.

7. The method of claim 6, wherein the user data is relocated from another location on the memory circuit.

8. The method of claim 1, wherein said selection is for a block in which to store system data.

9. The method of claim 1, wherein the list of free blocks is formed from less than all of the free blocks in the pool of free blocks.

10. The method of claim 1, wherein the list of free blocks is formed from all of the free blocks in the pool of free blocks.

11. The method of claim 1, wherein the experience count is the number of erase cycles experienced.

12. A non-volatile memory system, including

a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks;

and

control circuitry managing the storage of data on the memory circuit, where the control circuitry selects blocks to be written with data content from a list of free blocks, returns blocks whose data content is obsolete to a pool of free blocks, where the list of free blocks formed from members of the pool of free blocks, and orders the list of free blocks in increasing order of the blocks'"'"' experience count, where when selecting a block from the free block list, the selection is made from the list according to the ordering.

14. The non-volatile memory system claim of 12, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the control circuitry independently orders the list of free blocks in each sub-array in increasing order of experience count and selects a plurality of blocks from a corresponding number of sub-arrays and forming the plurality of blocks into a composite logical structure;

and wherein said returning blocks includes dissolving the composite logical structure.

15. The non-volatile memory system claim of 12, wherein the memory circuit is formed of a binary memory section and a multi-state memory section and said ordering is only performed for the multi-state section of the memory.

16. The non-volatile memory system claim of 12, wherein the memory system maintains the experience count of the blocks as an attribute of the corresponding block that is associated with the blocks address.

17. The non-volatile memory system claim of 12, wherein said selection is for a block in which to store user data.

18. The non-volatile memory system of claim of 17, wherein the user data is relocated from another location on the memory circuit.

19. The non-volatile memory system of claim 12, wherein said selection is for a block in which to store system data.

13. The non-volatile memory system of 12, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller forms multi-block logical structures spanning a corresponding number of sub-arrays, the multi-block logical structures being maintained in the free block list.

20. The non-volatile memory system of 12, wherein the list of free blocks is formed from less than all of the free blocks in the pool of free blocks.

21. The non-volatile memory system of 12, wherein the list of free blocks is formed from all of the free blocks in the pool of free blocks.

22. The non-volatile memory system of 12, wherein the experience count is the number of erase cycles experienced.

23. A method of operating a non-volatile memory system including a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks and control circuitry managing the storage of data on the memory circuit, the method including:

selecting blocks to be written with data content from a list of free blocks;

returning blocks whose data content is obsolete to a pool of free blocks, where the list of free blocks formed from members of the pool of free blocks; and

for the plurality of blocks, maintaining a corresponding experience count, wherein said selecting blocks from a free block list comprises;

searching the free block list to determine a first block having an experience count that is relatively low with respect to others of the blocks; and

in response to determining the first block having a relatively low experience count, discontinuing the searching and selecting the first block.

24. The method of claim 23, wherein said searching the free block list includes individually comparing the corresponding experience count of the blocks in the free block list against a value dependent upon an average experience count for a population of said blocks.

25. The method of claim 24, wherein the average is the average experience count for the blocks on the free block list.

26. The method of claim 24, wherein the average is the average experience count for the blocks on the memory circuit.

27. The method of claim 24, wherein the value dependent upon an average experience count is the average minus a predetermined number.

28. The method of claim 23, wherein in response to not finding a first block having an experience count that is relatively low based upon a predetermined criteria, selecting the block from the free block list having the lowest experience count of the blocks searched.

29. The method of claim 23, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller forms multi-block logical structures spanning a corresponding number of sub-arrays, the multi-block logical structures being maintained in the free block list.

30. The method of claim 23, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and an independent free block list;

wherein said selecting blocks includes selecting a plurality of blocks from a corresponding plurality of sub-arrays and forming the plurality of blocks into a composite logical structure;

wherein said returning blocks includes dissolving the composite logical structure; and

the individually comparing is performed independently in each sub-array.

31. The method of claim 23, wherein the memory circuit is formed a binary memory section and a multi-state memory section and said individually comparing the corresponding count of the blocks in the free block list and determining a first block in response thereto is only performed for the multi-state section of the memory.

32. The method of claim 23, wherein the memory system maintains the experience count of the blocks as an attribute of the corresponding block that is associated with the blocks address.

33. The method of claim 23, wherein said selection is for a block in which to store user data.

34. The method of claim 33, wherein the user data is relocated from another location on the memory circuit.

35. The method of claim 23, wherein said selection is for a block in which to store system data.

36. The method of claim 23, wherein the list of free blocks is formed from less than all of the free blocks in the pool of free blocks.

37. The method of claim 23, wherein the list of free blocks is formed from all of the free blocks in the pool of free blocks.

38. The method of claim 23, wherein the experience count is the number of erase cycles experienced.

39. A non-volatile memory system including

a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks;

and

control circuitry managing the storage of data on the memory circuit, where the control circuitry selects blocks to be written with data content from a list of free blocks, returns blocks whose data content is obsolete to a pool of free blocks, where the list of free blocks formed from members of the pool of free blocks; and

for the plurality of blocks, maintaining a corresponding experience count, wherein said selecting blocks from a free block list comprises;

searching the free block list to determine a first block having an experience count that is relatively low with respect to others of the blocks; and

in response to determining the first block having a relatively low experience count, discontinuing the searching and selecting the first block.

40. The non-volatile memory system of claim 39, wherein said searching the free block list includes individually comparing the corresponding experience count of the blocks in the free block list against a value dependent upon an average experience count for a population of said blocks.

41. The non-volatile memory system of claim 40, wherein the average is the average experience count for the blocks on the free block list.

42. The non-volatile memory system of claim 40, wherein the average is the average experience count for the blocks on the memory circuit.

43. The non-volatile memory system of claim 40, wherein the value dependent upon an average experience count is the average minus a predetermined number.

44. The non-volatile memory system of claim 39, wherein in response to not finding a first block having an experience count that is relatively low based upon a predetermined criteria, selecting the block from the free block list having the lowest experience count of the blocks searched.

45. The non-volatile memory system of claim 39, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller forms multi-block logical structures spanning a corresponding number of sub-arrays, the multi-block logical structures being maintained in the free block list.

46. The non-volatile memory system of claim 39, wherein the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and an independent free block list;

wherein said selecting blocks includes selecting a plurality of blocks from a corresponding plurality of sub-arrays and forming the plurality of blocks into a composite logical structure;

wherein said returning blocks includes dissolving the composite logical structure; and

the individually comparing is performed independently in each sub-array.

47. The non-volatile memory system of claim 39, wherein the memory circuit is formed a binary memory section and a multi-state memory section and said individually comparing the corresponding count of the blocks in the free block list and determining a first block in response thereto is only performed for the multi-state section of the memory.

48. The non-volatile memory system of claim 39, wherein the memory system maintains the experience count of the blocks as an attribute of the corresponding block that is associated with the blocks address.

49. The non-volatile memory system of claim 39, wherein said selection is for a block in which to store user data.

50. The non-volatile memory system of claim 49, wherein the user data is relocated from another location on the memory circuit.

51. The non-volatile memory system of claim 39, wherein said selection is for a block in which to store system data.

52. The non-volatile memory system of 39, wherein the list of free blocks is formed from less than all of the free blocks in the pool of free blocks.

53. The non-volatile memory system of 39, wherein the list of free blocks is formed from all of the free blocks in the pool of free blocks.

54. The non-volatile memory system of 39, wherein the experience count is the number of erase cycles experienced.

55. A method of performing a wear leveling operation in a non-volatile memory system including a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks and control circuitry managing the storage of data on the memory circuit, the method including:

selecting a first block containing valid data content from which to copy said valid data content;

selecting a second block not containing valid data content to which to copy said valid data content; and

for the plurality of blocks, maintaining a corresponding experience count, wherein said selecting a first block comprises;

searching a plurality of blocks containing valid data content to determine a block having an experience count that is relatively low with respect to others of the blocks; and

in response to determining said block having a relatively low experience count, discontinuing the searching and selecting said block having a relatively low experience count as the first block.

56. The method of claim 55, wherein said second block contains obsolete data content and the method further includes, subsequent to selecting the second block, erasing said obsolete data content.

57. The method of claim 55, wherein said second block is in an erased state.

58. The method of claim 55, wherein said selecting a first block further comprises:

selecting a number of blocks containing valid data content at random from the population of blocks containing valid data content to be said plurality of blocks containing valid data content that are searched to select the first block.

59. The method of claim 55, wherein said searching the plurality of blocks containing valid data content includes individually comparing the corresponding experience count of the plurality of blocks containing valid data content against a value dependent upon an average experience count for a population of said blocks.

60. The method of claim 59, wherein the average is the average experience count for the plurality of blocks containing valid data content.

61. The method of claim 59, wherein the average is the average experience count for the plurality of blocks containing valid data content.

62. The method of claim 59, wherein the value dependent upon an average experience count is the average minus a predetermined number.

63. The method of claim 55, wherein in response to not finding a first block having an experience count that is relatively low based upon a predetermined criteria, selecting the first block from the f plurality of blocks containing valid data content having the lowest experience count of the blocks searched.

64. The method of claim 55, wherein the memory system maintains the experience count of the blocks as an attribute of the corresponding block that is associated with the blocks address.

65. A non-volatile memory system including

a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks;

and

control circuitry managing the storage of data on the memory circuit, where the control circuitry selects a first block containing valid data content from which to copy said valid data content in a wear leveling operation, selects a second block not containing valid data content to which to copy said valid data content in the wear leveling operation, and for the plurality of blocks, maintains a corresponding experience count, wherein selecting a first block comprises;

searching a plurality of blocks containing valid data content to determine a block having an experience count that is relatively low with respect to others of the blocks; and

in response to determining said block having a relatively low experience count, discontinuing the searching and selecting said block having a relatively low experience count as the first block.

66. The non-volatile memory system of claim 65, wherein said second block contains obsolete data content and the method further includes, subsequent to selecting the second block, erasing said obsolete data content.

67. The non-volatile memory system of claim 65, wherein said second block is in an erased state.

68. The non-volatile memory system of claim 65, wherein said selecting a number of blocks containing valid data content at random from the population of blocks containing valid data content to be said plurality of blocks containing valid data content that are searched to select the first block.

69. The non-volatile memory system of claim 65, wherein said searching the plurality of blocks containing valid data content includes individually comparing the corresponding experience count of the plurality of blocks containing valid data content against a value dependent upon an average experience count for a population of said blocks.

70. The non-volatile memory system of claim 69, wherein the average is the average experience count for the plurality of blocks containing valid data content.

71. The non-volatile memory system of claim 69, wherein the average is the average experience count for the plurality of blocks containing valid data content.

72. The non-volatile memory system of claim 69, wherein the value dependent upon an average experience count is the average minus a predetermined number.

73. The non-volatile memory system of claim 65, wherein in response to not finding a first block having an experience count that is relatively low based upon a predetermined criteria, selecting the first block from the f plurality of blocks containing valid data content having the lowest experience count of the blocks searched.

74. The non-volatile memory system of claim 65, wherein the memory system maintains the experience count of the blocks as an attribute of the corresponding block that is associated with the blocks address.

75. A non-volatile memory system, comprising:

a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks; and

control circuitry managing the storage of data on the memory circuit, where the control circuitry tracks a corresponding experience count of the number of erase cycles experienced by the blocks and maintains the experience counts as an attribute associated and stored with the corresponding block'"'"'s physical address in data structures, including address tables, and updates a given block'"'"'s experience count in response to performing an erase cycle on corresponding block.

76. The non-volatile memory system of claim 75, wherein said experience count is the number of erase cycles experienced by the corresponding block.

77. The non-volatile memory system of claim 75, wherein said address tables include a logical address to physical address conversion table for blocks assigned to store user data.

78. The non-volatile memory system of claim 75, wherein said data structures further include a list of unassigned memory blocks.

79. The non-volatile memory system of claim 75, wherein said data structures further include a list of spare blocks.

80. The non-volatile memory system of claim 75, wherein a block'"'"'s count migrates with the block'"'"'s associated physical address as the associated physical address is moved between data structures.

81. The non-volatile memory system of claim 75, where the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller circuitry forms multi-block structures spanning a corresponding number of sub-arrays, and wherein the control circuitry maintains a single common count for a given multi-block structure.

82. The non-volatile memory system of claim 75, wherein the control circuitry further maintains a re-linking flag an attribute associated and stored with the corresponding block'"'"'s physical address.

83. The non-volatile memory system of claim 75, wherein the control circuitry further maintains a time stamp an attribute associated and stored with the corresponding block'"'"'s physical address.

84. A method of operating a non-volatile memory system that includes a memory circuit having a plurality of non-volatile memory cells formed into a plurality of multi-cell erase blocks and control circuitry managing the storage of data on the memory circuit, the method comprising:

tracking by the control circuitry tracks a corresponding experience count of the blocks;

maintaining the experience counts as an attribute associated and stored with the corresponding block'"'"'s physical address in data structures, including address tables; and

updating a given block'"'"'s experience count in response to performing an erase cycle on corresponding block.

85. The method of claim 84, wherein said experience count is the number of erase cycles experienced by the corresponding block.

86. The method of claim 84, wherein said address tables include a logical address to physical address conversion table for blocks assigned to store user data.

87. The method of claim 84, wherein said data structures further include a list of unassigned memory blocks.

88. The method of claim 84, wherein said data structures further include a list of spare blocks.

89. The method of claim 84, wherein a block'"'"'s count migrates with the block'"'"'s associated physical address as the associated physical address is moved between data structures.

90. The method of claim 84, where the memory circuit is formed of a plurality of sub-arrays each having a plurality of blocks and the controller circuitry forms multi-block structures spanning a corresponding number of sub-arrays, and wherein the control circuitry maintains a single common count for a given multi-block structure.

91. The method of claim 84, wherein the control circuitry further maintains a re-linking flag an attribute associated and stored with the corresponding block'"'"'s physical address.

92. The method of claim 84, wherein the control circuitry further maintains a time stamp an attribute associated and stored with the corresponding block'"'"'s physical address.