Data consolidation and garbage collection in direct data file storage memories
First Claim
Patent Images
1. For a re-programmable non-volatile memory system having a plurality of blocks of memory cells that are individually erased prior to data being written therein and that operates with an inventory of a minimum number of erased blocks ready to have data stored therein, a method of operation, comprising:
- receiving data of files logically addressed by unique file identifiers and offsets within the files, wherein said unique file identifiers and offsets within the files are used by the memory system for logically addressing the files,storing the received data of a first file as pages within one or more of the erased blocks that only partially fill a first one of the erased blocks, thereby leaving erased data storage capacity within the first partially filled block, and storing the received data of a second file as pages within one or more of the erased blocks that only partially fill a second one of the erased blocks, thereby leaving erased data storage capacity within the second partially filled block, andpostponing consolidating valid data from the partially filled first and second blocks into another one of the erased blocks until at least the inventory of the number of erased blocks is deemed insufficient to maintain the minimum number.
3 Assignments
0 Petitions
Accused Products
Abstract
Host system data files are written directly to a large erase block flash memory system with a unique identification of each file and offsets of data within the file but without the use of any intermediate logical addresses or a virtual address space for the memory. Directory information of where the files are stored in the memory is maintained within the memory system by its controller, rather than by the host.
-
Citations
11 Claims
-
1. For a re-programmable non-volatile memory system having a plurality of blocks of memory cells that are individually erased prior to data being written therein and that operates with an inventory of a minimum number of erased blocks ready to have data stored therein, a method of operation, comprising:
-
receiving data of files logically addressed by unique file identifiers and offsets within the files, wherein said unique file identifiers and offsets within the files are used by the memory system for logically addressing the files, storing the received data of a first file as pages within one or more of the erased blocks that only partially fill a first one of the erased blocks, thereby leaving erased data storage capacity within the first partially filled block, and storing the received data of a second file as pages within one or more of the erased blocks that only partially fill a second one of the erased blocks, thereby leaving erased data storage capacity within the second partially filled block, and postponing consolidating valid data from the partially filled first and second blocks into another one of the erased blocks until at least the inventory of the number of erased blocks is deemed insufficient to maintain the minimum number. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of operation of a re-programmable non-volatile memory system having a plurality of blocks of memory cells that are individually erased prior to data being written therein and which receive data having logical addresses of unique file identifiers and offsets within the individual files, wherein:
-
valid data from a first group of two or more blocks partially programmed with data of two or more files are occasionally consolidated into another block, said first group of two or more partially programmed blocks containing erased data storage capacity and no obsolete data, blocks containing valid data from a second group of one or more blocks that also contain obsolete data are occasionally garbage collected, only one of the data consolidation or garbage collection is carried out at one time, and priority is given to garbage collection over data consolidation. - View Dependent Claims (8, 9, 10, 11)
-
Specification