Method for allocating memory in a solid state memory disk

• US 5,535,369 A
• Filed: 06/07/1995
• Issued: 07/09/1996
• Est. Priority Date: 10/30/1992
• Status: Expired due to Term

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Barbarich, Steven S., Domonkos, Sara, Wells, Steven, Hasbun, Robert N.
• Primary Examiner(s): Chan, Eddie P.
• Assistant Examiner(s): BRAGDON, REGINALD GLENWOOD
• Application Number:
  US08/485,661
• Time in Patent Office: 398 Days
• Field of Search: 395/430, 395/497.02, 395/600
• US Class Current: 711/171
• CPC Class Codes: G06F 12/0246 in block erasable memory, e.g. flash memory
• CPC Class Codes: G06F 2212/401 Compressed data
• CPC Class Codes: G06F 3/0601 Interfaces specially adapted for storage systems
• CPC Class Codes: G06F 3/0664 at device level, e.g. emulation of a storage device or system

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.

Claims

1. 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.

2. 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.

3. 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.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.