← Back to Patent Explorer
US4503501A Expired / Lapsed US ⏱️ 0.0 years remaining

Adaptive domain partitioning of cache memory space

Assignee: Storage Technology Corp
•
Filing: 1982-11-15
•
Granted: 1985-03-05
•
Expires: 2002-11-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of operation of a memory array for storage of records of differing predetermined sizes is disclosed which features division of the array into domains which are substantially integral multiples of the predetermined record sizes. In a preferred embodiment the domain allocation may be varied adaptively in accordance with usage so as to enable more efficient use of the array.

Inventors

  • 👤 Richard L. Coulson
  • 👤 Ronald L. Blickenstaff
  • 👤 P. David Dodd
  • 👤 Robert J. Moreno
  • 👤 Dean P. Kinard

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 21:37
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0866; G06F2212/00; G06F2212/31; G06F2212/312; G06F2212/60; G06F2212/601

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 60 words
In a method of dividing a memory array into domains for the storage of data received in plural differing predetermined amounts from plural classes of storage devices, the improvement which comprises: effectively subdividing said array into domains of sizes which are each substantially integral multiples of said predetermined amounts of data stored therein by assigning starting addresses to said domains.
Claim 2
Dependent Claim 60 words
In a method of dividing a memory array into domains for the storage of data received in plural differing predetermined amounts from plural classes of storage devices, the improvement which comprises: effectively subdividing said array into domains of sizes which are each substantially integral multiples of said predetermined amounts of data stored therein by assigning starting addresses to said domains.
Claim 3
Dependent Claim 19 words
The improvement of claim 1 wherein said domains are allocated to one class of device at an initialization stage.
Claim 4
Dependent Claim 69 words
The improvement of claim 2 wherein the allocation of said domains may be varied from device class to device class over time, said variation being controlled in accordance with the ratio of the number of domains allocated to a particular device type to usage of said domains, and being accomplished by subdividing domains to be reallocated into areas of size equal to one of said predetermined amounts of data.
Claim 5
Dependent Claim 24 words
The improvement of claim 1 wherein said predetermined amounts of data are equivalent to complete tracks of data stored on magnetic disk storage media.
Claim 6
Independent Claim 83 words
A method of organizing an array of memory locations to be used to store data records of plural differing predetermined lengths comprising the steps of: determining a domain size which is substantially an integral multiple of all said plural predetermined data amounts; effectively dividing said array into domains of the thus determined domain size by assigning starting addresses in said array to each domain; and allocating each of said domains to storage of records of a single one of said predetermined data amounts.
Claim 7
Independent Claim 83 words
A method of organizing an array of memory locations to be used to store data records of plural differing predetermined lengths comprising the steps of: determining a domain size which is substantially an integral multiple of all said plural predetermined data amounts; effectively dividing said array into domains of the thus determined domain size by assigning starting addresses in said array to each domain; and allocating each of said domains to storage of records of a single one of said predetermined data amounts.
Claim 8
Dependent Claim 20 words
The method of claim 5 wherein said allocation may be varied in accordance with usage of each of said domains.
Claim 9
Dependent Claim 168 words
A caching memory subsystem for attachment to a host computer and magnetic disk devices of differing classes, in which various predetermined amounts of data are stored on the tracks of the disk of each class of disk devices comprising: a solid-state cache memory array and a cache manager, wherein said solid-state cache memory array is effectively divided into plural domains by assignment of starting addresses in said array to each domain, said domains being so sized as to contain substantially integral multiples of said predetermined amounts of data; said cache manager comprising means for copying data stored on magnetic disk storage devices into said solid-state cache memory array; and wherein said cache manager has means to divide each of said domains into frames sized to contain an amount of data equal to one of said predetermined amounts of data, and means to assign the address of a frame of corresponding size to data to be copied from one of said disk tracks to said solid-state caching memory array.
Claim 10
Dependent Claim 168 words
A caching memory subsystem for attachment to a host computer and magnetic disk devices of differing classes, in which various predetermined amounts of data are stored on the tracks of the disk of each class of disk devices comprising: a solid-state cache memory array and a cache manager, wherein said solid-state cache memory array is effectively divided into plural domains by assignment of starting addresses in said array to each domain, said domains being so sized as to contain substantially integral multiples of said predetermined amounts of data; said cache manager comprising means for copying data stored on magnetic disk storage devices into said solid-state cache memory array; and wherein said cache manager has means to divide each of said domains into frames sized to contain an amount of data equal to one of said predetermined amounts of data, and means to assign the address of a frame of corresponding size to data to be copied from one of said disk tracks to said solid-state caching memory array.
Claim 11
Dependent Claim 73 words
The caching memory subsystem of claim 7 wherein said cache manager further comprises means for reassignment of particular ones of said domains from one class of disk device to a second class upon indication that a usage imbalance exists, and to thereupon redivide said reassigned domains into frames sized to store amounts of data corresponding to the predetermined amount of data stored on one track of said disk device of the second class.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-03-04 1988-09-03 1989-03-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-03-04 1992-09-03 1993-03-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-03-04 1996-09-03 1997-03-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag