Patent US4087794A successfully refreshed from Google Patents.
US4087794A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multi-level storage hierarchy emulation monitor
Assignee: International Business Machines Corp
•
Filing: 1973-01-02
•
Granted: 1978-05-02
•
Expires: 1993-01-02
Abstract
Abstract A machine for emulating the results of multi-level storage hierarchies by providing an associative storage directory for each level other than main storage. Address sequences to drive the directories are derived from a single level digital computer by recording sequences on tape or by dynamically monitoring computer operation. Individual addresses are skewed an appropriate number of bits depending upon the block size and the number of classes being emulated at any given level, so that those bits of the monitored address indicating segment name are presented to the directory for comparison with its contents in the appropriate class. Means are provided for transposing the segment and class names at higher levels to segment and class names at lower levels. Counting means are provided to record hits, misses and pushes at various levels in order to provide data for calculating average access times for the particular multi-level storage hierarchy being emulated.
Inventors
- 👤 William F. Beausoleil
- 👤 Peter P. Hennet
- 👤 Klim Maling
- 👤 Norman K. Powers
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 16:22
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/30; G06F11/34; G06F11/3457; G06F11/3461; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0893; G06F12/0897; G06F11/3409; G06F11/3419; G06F11/3466; G06F11/348; G06F11/3485; G06F2201/00; G06F2201/88
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
154 words
For use with an address sequence produced from a computing system having a single level storage, a system for obtaining data for use in computing average access times for completing storage reference operations in a multi-level storage hierarchy, comprising emulation means for emulating each hierarchical level in said multi-level storage other than the main storage level by receiving said address sequence and recording the segments of storage located at each of said emulated levels, counting means connected to said emulation means to provide a record of hits and misses for fetch and store memory references from said address sequence at each of said emulation means, and address generation means connected between emulation means for adjacent levels for transferring a displaced segment of storage at a higher level to a lower level where said displaced segment is pushed out of said higher level by the need to record a segment received from said address sequence.
Claim 2
Dependent Claim
154 words
For use with an address sequence produced from a computing system having a single level storage, a system for obtaining data for use in computing average access times for completing storage reference operations in a multi-level storage hierarchy, comprising emulation means for emulating each hierarchical level in said multi-level storage other than the main storage level by receiving said address sequence and recording the segments of storage located at each of said emulated levels, counting means connected to said emulation means to provide a record of hits and misses for fetch and store memory references from said address sequence at each of said emulation means, and address generation means connected between emulation means for adjacent levels for transferring a displaced segment of storage at a higher level to a lower level where said displaced segment is pushed out of said higher level by the need to record a segment received from said address sequence.
Claim 3
Dependent Claim
23 words
The system of claim 1 wherein said counting means includes additional counting means to provide a record of pushes from said higher level.
Claim 4
Dependent Claim
26 words
The system of claim 2 in which each of said emulation means include associative storage directories for class recording segment names derived from said address sequence.
Claim 5
Dependent Claim
52 words
The system of claim 3 in which said emulsion means further include comparator means for comparing segment names derived from said address sequence to segment names in the appropriate class of said directories and circuit means to update said directories in accordance with a selected storage philosophy and a selected updating technique.
Claim 6
Dependent Claim
74 words
The system of claim 4 wherein said emulation means further include means for obtaining a copy of each address in said address sequence and where said address was generated from CPU activity, means for passing a selected portion of each said address to at least a highest level directory, and where said address was generated from I/O activity, means for passing a selected portion of each said address to a selected lower level directory.
Claim 7
Dependent Claim
24 words
The system of claim 5 wherein said counting means include designated counters to provide a record of hits and misses resultant from I/O references.
Claim 8
Dependent Claim
45 words
The system of claim 6 wherein each of said emulation means further include a first switch means to set the number of classes and a second switch means to set the memory block size so that each of said hierarchical levels may be configured differently.
Claim 9
Dependent Claim
55 words
The system of claim 7 wherein said counting means includes counters at the highest level to count hits and misses for a two-way associative storage directory and other counters to simultaneously count hits and misses for a four-way associative directory so that more than one degree of associativity can be emulated in a single run.
Claim 10
Dependent Claim
19 words
The apparatus of claim 8 including switch means to select a particular storage philosphy for a particular storage level.
References Cited (Backward Citations)
US3675215A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-05-01 | 1981-10-31 | 1982-05-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-05-01 | 1985-10-31 | 1986-05-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-05-01 | 1989-10-31 | 1990-05-02 | $7700.00 | Window Closed / Lapsed |