US5535369A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for allocating memory in a solid state memory disk
Assignee: Intel Corp
•
Filing: 1995-06-07
•
Granted: 1996-07-09
•
Expires: 2015-06-07
Abstract
Abstract A method of allocating free physical memory in a solid state memory disk for a sector of data of a given size is described. Allocation begins by determining whether sufficient free memory remains in the block to which the previous sector of data was written. If there is not sufficient free memory remaining, then selection of another block to allocate the sector of data begins. The selection is based on the sum of the amount of free memory in a selected block and one of the following: 1) the amount of invalid data in the block; 2) the cycle count for the block; 3) the amount of invalid data as compared to a maximum amount of invalid data for all non-volatile memory devices associated with the block; and 4) the number of blocks already allocated to all non-volatile memory devices associated with the block. Afterward, the block with the greatest amount of available memory is selected to store the sector of data.
Inventors
- 👤 Steven Wells
- 👤 Robert N. Hasbun
- 👤 Sara Domonkos
- 👤 Steven S. Barbarich
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 18:31
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F12/00; G06F12/02; G06F12/0223; G06F12/023; G06F12/0238; G06F12/0246; G06F2212/00; G06F2212/40; G06F2212/401; G06F3/0628; G06F3/0662; G06F3/0664
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
201 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to an amount of memory containing invalid data in that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the select, block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 2
Dependent Claim
201 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to an amount of memory containing invalid data in that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the select, block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 3
Dependent Claim
41 words
The method of claim 1 wherein the step of reserving the given size of free memory in the selected block further comprises the step of storing a first offset representative of the given size into a header in the selected block.
Claim 4
Dependent Claim
52 words
The method of claim 1 wherein appropriate blocks excludes at least one of the following types of blocks: blocks having a busy associated nonvolatile memory device, blocks having an associated nonvolatile memory device selected for clean-up, blocks selected for clean-up, bad blocks, blocks having a maximum number of headers already written into.
Claim 5
Dependent Claim
197 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block: b) generating a second number corresponding to a cycle count for that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 6
Dependent Claim
197 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block: b) generating a second number corresponding to a cycle count for that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 7
Dependent Claim
41 words
The method of claim 4 wherein the step of reserving the given size of free memory in the selected block further comprises the step of storing a first offset representative of the given size into a header in the selected block.
Claim 8
Dependent Claim
52 words
The method of claim 4 wherein appropriate blocks excludes at least one of the following types of blocks: blocks having a busy associated nonvolatile memory device, blocks having an associated nonvolatile memory device selected for clean-up, blocks selected for clean-up, bad blocks, blocks having a maximum number of headers already written into.
Claim 9
Dependent Claim
221 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to an amount of memory containing invalid data as compared to a possible maximum amount of memory that can contain invalid data for all nonvolatile memory devices associated with that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 10
Dependent Claim
221 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to an amount of memory containing invalid data as compared to a possible maximum amount of memory that can contain invalid data for all nonvolatile memory devices associated with that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 11
Dependent Claim
41 words
The method of claim 7 wherein the step of reserving the given size of free memory in the selected block further comprises the step of storing a first offset representative of the given size into a header in the selected block.
Claim 12
Dependent Claim
52 words
The method of claim 7 wherein appropriate blocks excludes at least one of the following types of blocks: blocks having a busy associated nonvolatile memory device, blocks having an associated nonvolatile memory device selected for clean-up, blocks selected for clean-up, bad blocks, blocks having a maximum number of headers already written into.
Claim 13
Dependent Claim
207 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to a number of block portions already allocated in all nonvolatile memory devices associated with that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 14
Dependent Claim
207 words
In a solid state memory having a plurality of blocks of memory wherein a portion of each block is located in at least one associated nonvolatile memory device, a method of allocating free memory to a calling process for a unit of data having a variable given size, the method comprising the steps of: A) selecting as a selected block a first block of memory to which data was last allocated if the first block has an amount of free memory equal to or greater than the given size; B) if the amount of free memory in the first block is less than the given size, then 1) for each appropriate block of memory: a) generating a first number corresponding to an amount of free memory in that block; b) generating a second number corresponding to a number of block portions already allocated in all nonvolatile memory devices associated with that block; and c) summing the first and second numbers to generate a score; 2) selecting a second block having a greatest score as the selected block, if an amount of free memory in the selected block is not less than the given size; and C) reserving the given size of free memory in the selected block.
Claim 15
Dependent Claim
41 words
The method of claim 10 wherein the step of reserving the given size of free memory in the selected block further comprises the step of storing a first offset representative of the given size into a header in the selected block.
Claim 16
Dependent Claim
52 words
The method of claim 10 wherein appropriate blocks excludes at least one of the following types of blocks: blocks having a busy associated nonvolatile memory device, blocks having an associated nonvolatile memory device selected for clean-up, blocks selected for clean-up, bad blocks, blocks having a maximum number of headers already written into.
References Cited (Backward Citations)
US3648255A
Cited
US3729712A
Cited
US4528624A
Cited
US4644494A
Cited
US4896262A
Cited
US4642759A
Cited
EP0175458A2
Cited
US4758944A
Cited
US4958315A
Cited
US4763305A
Cited
US4802117A
Cited
US5111385A
Cited
US5070474A
Cited
US5012425A
Cited
US5101490A
Cited
EP0392895B1
Cited
US5131089A
Cited
US5200959A
Cited
US5199033A
Cited
US5339411A
Cited
GB2251323A
Cited
GB2251324A
Cited
US5237673A
Cited
CA2088442A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-07-09 | 2000-01-08 | 2000-07-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-09 | 2004-01-08 | 2004-07-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-09 | 2008-01-08 | 2008-07-09 | $7700.00 | Window Closed / Lapsed |