Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
279 words
A processor-controlled method of file management for a nonvolatile semiconductor memory with a plurality of physical erase blocks, wherein bits of the memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first physical erase block of the memory for storing an active file and a deleted file; (2) allocating a second physical erase block of the memory for storing a copy of the active file; (3) storing in an allocated first portion of a third physical erase block of the memory information as to whether a physical erase block of the memory has been allocated to store the active and deleted files or allocated to store the copy of the active file; (4) reclaiming memory space by storing in the second physical erase block of the memory the copy of the active file and by erasing the entire first physical erase block of the memory in order to permit reuse of the first physical erase block of the memory for storage; (5) tracking a number of times a physical erase block of the memory has been cycled and storing that number as a cycle count in an allocated second portion of the third physical erase block of the memory; (6) storing in an allocated third portion of the third physical erase block of the memory a directory of active files: (7) minimizing cycling distributions between physical erase blocks of the memory by choosing for reclamation a physical erase block of the memory with a lowest cycle count.
Claim 2
Dependent Claim
62 words
The processor-controlled method of claim 1, further comprising the steps of storing in an allocated fourth portion of the third physical erase block of the memory (1) an indication as to whether a physical erase block of the memory is in use or not and (2) and indication as to whether a physical erase block of the memory is defective or not.
Claim 3
Dependent Claim
34 words
The processor-controlled method of claim 1, further comprising the step of storing in an allocated fourth portion of the third physical erase block of the memory information concerning a file structure of the memory.
Claim 4
Dependent Claim
53 words
The processor-controlled method of claim 3, wherein the information stored in the fourth portion of the third physical erase block of the memory comprises (i) information concerning a file structure type of the memory; (ii) information that defines a formattable capacity of the file structure; (iii) information concerning the directory of active files.
Claim 5
Dependent Claim
16 words
The processor-controlled method of claim 1, wherein the directory of active files comprises a linked list.
Claim 6
Dependent Claim
15 words
The processor-controlled method of claim 3, wherein the file structure is a variable-length file structure.
Claim 7
Dependent Claim
15 words
The processor-controlled method of claim 3, wherein the file structure is a sectored file structure.
Claim 8
Dependent Claim
39 words
The processor-controlled method of claim 1, further comprising the step of storing information in an allocated fourth portion of the third physical erase block of the memory that indicates a maximum number of erase cycles recommended for the memory.
Claim 9
Dependent Claim
279 words
A processor-controlled method of file management for a nonvolatile semiconductor first memory with a plurality of physical erase blocks, wherein bits of the first memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first physical erase block of the first memory for storing an active file and a deleted file; (2) allocating a second physical erase block of the first memory for storing a copy of the active file; (3) storing in an allocated first portion of a second memory information as to whether a physical erase block of the first memory has been allocated to store the active and deleted files or allocated to store the copy of the active file; (4) reclaiming memory space of the first memory by storing in the second physical erase block of the first memory the copy of the active file and by erasing the entire first physical erase block of the first memory in order to permit reuse of the first physical erase block of the first memory for storage; (5) tracking a number of times a physical erase block of the first memory has been cycled and storing that number as a cycle count in an allocated second portion of the second memory; (6) storing in an allocated third portion of the second memory a directory of active files; (7) minimizing cycling distributions between physical erase blocks of the first memory by choosing for reclamation a physical erase block of the first memory with a lowest cycle count.
Claim 10
Dependent Claim
59 words
The processor-controlled method of claim 9, further comprising the step of storing in an allocated fourth portion of the second memory (1) an indication as to whether a physical erase block of the first memory is in use or not and (2) an indication as to whether a physical erase block of the first memory is defective or not.
Claim 11
Dependent Claim
30 words
The processor-controlled method of claim 9, further comprising the step of storing in an allocated fourth portion of the second memory information concerning a file structure of the first memory.
Claim 12
Dependent Claim
49 words
The processor-controlled method of claim 11, wherein the information stored in the fourth portion of the second memory comprises (i) information concerning a file structure type of the first memory; (ii) information that defines a formattable capacity of the file structure; (iii) information concerning the directory of active files.
Claim 13
Dependent Claim
16 words
The processor-controlled method of claim 9, wherein the directory of active files comprises a linked list.
Claim 14
Dependent Claim
17 words
The processor-controlled method of claim 9, wherein the directory of active files is an alterable hierarchical directory.
Claim 15
Dependent Claim
15 words
The processor-controlled method of claim 11, wherein the file structure is a variable-length file structure.
Claim 16
Dependent Claim
15 words
The processor-controlled method of claim 11, wherein the file structure is a sectored file structure.
Claim 17
Dependent Claim
18 words
The processor-controlled method of claim 9, wherein the second memory is a byte-alterable electrically erasable programmable read-only memory.
Claim 18
Dependent Claim
14 words
The processor-controlled method of claim 9, wherein the second memory is a random-access memory.
Claim 19
Dependent Claim
35 words
The processor-controlled method of claim 9, further comprising the step of storing information in an allocated fourth portion of the second memory that indicates a maximum number of erase cycles recommended for the first memory.
Claim 20
Dependent Claim
307 words
A processor-controlled method of file management for a nonvolatile semiconductor memory with a plurality of physical erase blocks, wherein bits of the memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first sector of a first physical erase block of the memory for storing an active file and a second sector of the first physical erase block for storing a deleted file; (2) allocating a first sector of a second physical erase block of the memory for storing a copy of the active file; (3) storing in a first portion of an allocated third physical erase block of the memory information as to whether a sector of a physical erase block of the memory has been allocated to store one of the active and deleted files or allocated to store the copy of the active file; (4) reclaiming memory space by storing in the first sector of the second physical erase block of the memory the copy of the active file and by erasing the entire first physical erase block of the memory in order to permit reuse of the first physical erase block of the memory for storage; (5) tracking a number of time a physical erase block of the memory has been cycled and storing that number as a cycle count in a second portion of the allocated third physical erase block of the memory; (6) storing in a third portion of the allocated third physical erase block of the memory a directory of active files; (7) minimizing cycling distributions between physical erase blocks of the memory by choosing for reclamation a physical erase block of the memory with a lowest cycle court.
Claim 21
Dependent Claim
62 words
The processor-controlled method of claim 20, further comprising the step of storing in a fourth portion of the allocated third physical erase block of the memory (1) an indication as to whether a physical erase block of the memory is in use or not and (2) an indication as to whether a physical erase block of the memory is defective or not.
Claim 22
Dependent Claim
34 words
The processor-controlled method of claim 20, further comprising the step of storing in a fourth portion of the allocated third physical erase block of the memory information concerning a file structure of the memory.
Claim 23
Dependent Claim
16 words
The processor-controlled method of claim 20, wherein the directory of active files comprises a linked list.
Claim 24
Dependent Claim
36 words
The processor-controlled method of claim 20, further comprising the step of storing information in an allocated fourth portion of the third physical erase block that indicates a maximum number of erase cycles recommended for the memory.
Claim 25
Dependent Claim
308 words
A processor-controlled method of file management for a nonvolatile semiconductor first memory with a plurality of physical erase blocks, wherein bits of the memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first sector of a first physical erase block of the first memory for storing an active file and a second sector of the first physical erase block for storing a deleted file; (2) allocating a first sector of a second physical erase block of the first memory for storing a copy of the active file; (3) storing in an allocated first portion of a second memory separate from the first memory information as to whether a sector of a physical erase block of the memory has been allocated to store one of the active and deleted files or allocated to store the copy of the active file; (4) cleaning up the first memory by storing in the first sector of the second physical erase block of the first memory the copy of the active file and by erasing the entire first physical erase block of the first memory in order to permit reuse of the first physical erase block of the first memory for storage; (5) tracking a number of times a physical erase block of the first memory has been cycled and storing that number as a cycle count in an allocated second portion of the second memory; (6) storing in a allocated third portion of the second memory a directory of active files; (7) minimizing cycling distributions between physical erase blocks of the first memory by choosing for reclamation a physical erase block of the first memory with a lowest cycle count.
Claim 26
Dependent Claim
308 words
A processor-controlled method of file management for a nonvolatile semiconductor first memory with a plurality of physical erase blocks, wherein bits of the memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first sector of a first physical erase block of the first memory for storing an active file and a second sector of the first physical erase block for storing a deleted file; (2) allocating a first sector of a second physical erase block of the first memory for storing a copy of the active file; (3) storing in an allocated first portion of a second memory separate from the first memory information as to whether a sector of a physical erase block of the memory has been allocated to store one of the active and deleted files or allocated to store the copy of the active file; (4) cleaning up the first memory by storing in the first sector of the second physical erase block of the first memory the copy of the active file and by erasing the entire first physical erase block of the first memory in order to permit reuse of the first physical erase block of the first memory for storage; (5) tracking a number of times a physical erase block of the first memory has been cycled and storing that number as a cycle count in an allocated second portion of the second memory; (6) storing in a allocated third portion of the second memory a directory of active files; (7) minimizing cycling distributions between physical erase blocks of the first memory by choosing for reclamation a physical erase block of the first memory with a lowest cycle count.
Claim 27
Dependent Claim
57 words
The processor-controlled method of claim 25, further comprising the step of storing in an allocated fourth portion of the second memory (1) an indication as to whether a physical erase block of the memory is in use or not and (2) an indication as to whether a physical erase block of the memory is defective or not.
Claim 28
Dependent Claim
30 words
The processor-controlled method of claim 25, further comprising the step of storing in an allocated fourth portion of the second memory information concerning a file structure of the first memory.
Claim 29
Dependent Claim
16 words
The processor-controlled method of claim 25, wherein the directory of active files comprises a linked list.
Claim 30
Dependent Claim
17 words
The processor-controlled method of claim 25, wherein the directory of active files is an alterable hierarchical directory.
Claim 31
Dependent Claim
18 words
The processor-controlled method of claim 25, wherein the second memory is a byte-alterable electrically erasable programmable read-only memory.
Claim 32
Dependent Claim
14 words
The processor-controlled method of claim 25, wherein the second memory is a random-access memory.
Claim 33
Dependent Claim
35 words
The processor-controlled method of claim 25, further comprising the step of storing information in an allocated fourth portion of the second memory that indicates a maximum number of erase cycles recommended for the first memory.
Claim 34
Dependent Claim
247 words
A processor-controlled method of file management for a nonvolatile semiconductor memory with a plurality of physical erase blocks, wherein bits of the memory cannot be overwritten from a first logical state to a second logical state without a prior erasure, wherein erasure is by physical erase block and not on an individual byte basis, the method comprising the steps of: (1) allocating a first portion of the memory in a first physical erase block for storing an active file and a deleted file; (2) allocating a second portion of the memory in a second physical erase block for storing a copy of the active file; (3) storing in an allocated third portion of the memory information as to whether a portion of the memory has been allocated to store the active and deleted files or allocated to store the copy of the active file; (4) reclaiming memory space by storing in the second portion of the memory the copy of the active file and by erasing the first physical erase block including the first portion of the memory in order to permit reuse of the first portion of the memory for storage; (5) tracking a number of times a portion of the memory has been cycled and storing the number as a cycle count in an allocated fourth portion of the memory; (6) minimizing cycling distributions between physical erase blocks of the memory by choosing for reclamation a portion of the memory with a lowest cycle count.