US5696929A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Flash EEPROM main memory in a computer system
Assignee: Intel Corp
•
Filing: 1995-10-03
•
Granted: 1997-12-09
•
Expires: 2015-10-03
Abstract
Abstract A flash EEPROM memory array including a cache buffer for storing lines of data being written to all addresses in main memory; a plurality of holding buffers for storing lines of data from the cache buffer addressed to a particular block of addresses in main memory; a plurality of blocks of flash EEPROM main memory for storing lines of data from a holding buffer directed to a particular block of addresses in main memory; and control circuitry for writing lines of data addressed to a particular block of addresses in main memory from the cache buffer to a holding buffer when the cache buffer fills or a holding buffer limit is reached whichever occurs first, writing valid data from an addressed block of flash memory to lines of the holding buffer not holding valid data written from the cache buffer, erasing the addressed block of flash memory, and writing all of the lines in the holding buffer to the addressed block of flash memory.
Inventors
- 👤 Robert N. Hasbun
- 👤 Asad Faizi
- 👤 Joann Lam
- 👤 Peter J. Ruscito
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 15:30
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/06; G06F12/08; G06F12/0802; G06F12/0875; G06F12/0223; G06F12/023; G06F12/0238; G06F12/0246; G06F2212/00; G06F2212/72; G06F2212/7203
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
130 words
A method of storing data in a block erasable nonvolatile memory comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when the cache buffer is full; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and f) copying the same holding buffer to the same identified block.
Claim 2
Independent Claim
130 words
A method of storing data in a block erasable nonvolatile memory comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when the cache buffer is full; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and f) copying the same holding buffer to the same identified block.
Claim 3
Dependent Claim
79 words
The method of claim 1 wherein step a) further comprises the steps of: i) replacing a cache buffer line entry with a selected received cache line, if the cache buffer entry has a same address and same identified block as the selected received cache line; and ii) storing the selected received cache line at an empty cache buffer line entry, if no cache buffer entry has the same address and same identified block as the selected received cache line.
Claim 4
Dependent Claim
19 words
The method of claim 1 wherein the block erasable nonvolatile memory comprises flash electrically erasable programmable read only memory.
Claim 5
Dependent Claim
13 words
The method of claim 1 wherein the cache buffer comprises random access memory.
Claim 6
Dependent Claim
14 words
The method of claim 1 wherein the cache buffer is a fully associative cache.
Claim 7
Independent Claim
155 words
A method of storing data in a block erasable nonvolatile memory, comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when a threshold number of cache lines for the same identified block is stored within the cache buffer, wherein the threshold number is equal to the size of the same identified block; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and copying the same holding buffer to the same identified block.
Claim 8
Independent Claim
155 words
A method of storing data in a block erasable nonvolatile memory, comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when a threshold number of cache lines for the same identified block is stored within the cache buffer, wherein the threshold number is equal to the size of the same identified block; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and copying the same holding buffer to the same identified block.
Claim 9
Dependent Claim
79 words
The method of claim 6 wherein step a) further comprises the steps of: i) replacing a cache buffer line entry with a selected received cache line, if the cache buffer entry has a same address and same identified block as the selected received cache line; and ii) storing the selected received cache line at an empty cache buffer line entry, if no cache buffer entry has the same address and same identified block as the selected received cache line.
Claim 10
Dependent Claim
19 words
The method of claim 6 wherein the block erasable nonvolatile memory comprises flash electrically erasable programmable read only memory.
Claim 11
Dependent Claim
13 words
The method of claim 6 wherein the cache buffer comprises random access memory.
Claim 12
Dependent Claim
14 words
The method of claim 6 wherein the cache buffer is a fully associative cache.
Claim 13
Independent Claim
156 words
A method of storing data in a block erasable nonvolatile memory, comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when a threshold number of cache lines for the same identified block is stored within the cache buffer, wherein the threshold number is equal to the size of the same holding buffer; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and f) copying the same holding buffer to the same identified block.
Claim 14
Independent Claim
156 words
A method of storing data in a block erasable nonvolatile memory, comprising the steps of: a) storing received cache lines into a cache buffer, wherein each line is associated with an address within an identified block of a plurality of blocks of nonvolatile memory; b) copying every cache line associated with a same identified block from the cache buffer to a same holding buffer of a plurality of holding buffers, when a threshold number of cache lines for the same identified block is stored within the cache buffer, wherein the threshold number is equal to the size of the same holding buffer; c) marking every copied cache line within the cache buffer as invalid; d) replacing every cache line identified as invalid within the same holding buffer with a corresponding valid cache line from the same identified block; e) erasing the same identified block; and f) copying the same holding buffer to the same identified block.
Claim 15
Dependent Claim
80 words
The method of claim 11 wherein step a) further comprises the steps of: i) replacing a cache buffer line entry with a selected received cache line, if the cache buffer entry has a same address and same identified block as the selected received cache line; and ii) storing the selected received cache line at an empty cache buffer line entry, if no cache buffer entry has the same address and the same identified block as the selected received cache line.
Claim 16
Dependent Claim
19 words
The method of claim 11 wherein the block erasable nonvolatile memory comprises flash electrically erasable programmable read only memory.
Claim 17
Dependent Claim
13 words
The method of claim 11 wherein the cache buffer comprises random access memory.
Claim 18
Dependent Claim
14 words
The method of claim 11 wherein the cache buffer is a fully associative cache.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-12-08 | 2001-06-09 | 2001-12-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-12-08 | 2005-06-09 | 2005-12-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-12-08 | 2009-06-09 | 2009-12-09 | $7700.00 | Window Closed / Lapsed |