Method for merging memory blocks, fetching associated disk chunk

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395425, 395250, 3642527, 3649622, 364DIG1, G06F 732, G06F 1200

Patent

active

054209838

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.

REFERENCES:
patent: 3814921 (1974-06-01), Nibby et al.
patent: 4131942 (1978-12-01), Gillett et al.
patent: 4298929 (1981-11-01), Capozzi
patent: 4437155 (1984-03-01), Sawyer et al.
patent: 4489378 (1984-12-01), Dixon et al.
patent: 4636946 (1987-01-01), Hartung et al.
patent: 4779232 (1988-10-01), Fukunaka et al.
patent: 4882642 (1989-11-01), Tayler et al.
patent: 4972316 (1990-11-01), Dixon et al.
patent: 4972364 (1990-11-01), Barrett et al.
patent: 5109485 (1992-04-01), Smith, Jr.
patent: 5109500 (1992-04-01), Iseki et al.
patent: 5146573 (1992-09-01), Sato et al.
patent: 5197135 (1993-03-01), Eickemeyer et al.
patent: 5235693 (1993-08-01), Chinnaswamy et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for merging memory blocks, fetching associated disk chunk does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for merging memory blocks, fetching associated disk chunk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for merging memory blocks, fetching associated disk chunk will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-369268

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.