US5420983A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for merging memory blocks, fetching associated disk chunk, merging memory blocks with the disk chunk, and writing the merged data
Assignee: Hewlett Packard Development Co LP
•
Filing: 1992-08-12
•
Granted: 1995-05-30
•
Expires: 2012-08-12
Abstract
Abstract A method for reducing the number of I/O requests required to write data to a disk drive of a computer system. The computer system includes a read cache for storing old data read from the disk drive, and a write cache for storing new data to be written to the disk drive. The method selectively merges old data in the read cache with new data in the write cache to form at most two physically contiguous data segments which can be written to the disk drive with at most two I/O requests.
Inventors
- 👤 Eric S. Noya
- 👤 Randy M. Arnott
- 👤 Mitchell N. Rosich
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 04:22
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0804; G06F12/0866
Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
219 words
A method implemented in a computer for merging data to be written to a disk drive of the computer, the disk drive organized into a plurality of disk chunks for storing data, each disk chunk of the plurality of disk chunks including a plurality of disk blocks, comprising: identifying a memory block to be written to the disk drive, said memory block stored in a non-volatile memory of the computer, said memory block storing data associated with a corresponding one of said disk blocks, said corresponding one of said disk blocks included in a particular disk chunk; determining if said non-volatile memory stores additional memory blocks associated with said particular disk chunk; if said additional memory blocks when merged with said memory block form more than two physically contiguous data segments, reading said particular disk chunk into said volatile memory as a memory chunk, merging said additional memory blocks with said memory block and said memory chunk, and writing said memory chunk to the disk drive after merging; and otherwise if said additional memory block when merged with said memory block form less than three physically contiguous data segment, writing said less than three physically contiguous data segments to the disk drive to update said particular disk chunk in no more than two physical accesses to the disk drive.
Claim 2
Independent Claim
219 words
A method implemented in a computer for merging data to be written to a disk drive of the computer, the disk drive organized into a plurality of disk chunks for storing data, each disk chunk of the plurality of disk chunks including a plurality of disk blocks, comprising: identifying a memory block to be written to the disk drive, said memory block stored in a non-volatile memory of the computer, said memory block storing data associated with a corresponding one of said disk blocks, said corresponding one of said disk blocks included in a particular disk chunk; determining if said non-volatile memory stores additional memory blocks associated with said particular disk chunk; if said additional memory blocks when merged with said memory block form more than two physically contiguous data segments, reading said particular disk chunk into said volatile memory as a memory chunk, merging said additional memory blocks with said memory block and said memory chunk, and writing said memory chunk to the disk drive after merging; and otherwise if said additional memory block when merged with said memory block form less than three physically contiguous data segment, writing said less than three physically contiguous data segments to the disk drive to update said particular disk chunk in no more than two physical accesses to the disk drive.
Claim 3
Dependent Claim
25 words
The method of claim 1 further comprising: identifying a least recently used memory block of the non-volatile memory to be written to the disk drive.
References Cited (Backward Citations)
US3814921A
Cited
US4131942A
Cited
US4298929A
Cited
US4437155A
Cited
US4489378A
Cited
US4636946A
Cited
US4779232A
Cited
US5109500A
Cited
US4972364A
Cited
US4972316A
Cited
US4882642A
Cited
US5109485A
Cited
US5146573A
Cited
US5235693A
Cited
US5197135A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-05-29 | 1998-11-28 | 1999-05-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-29 | 2002-11-28 | 2003-05-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-29 | 2006-11-28 | 2007-05-30 | $7700.00 | Window Closed / Lapsed |