Patent US654390A successfully refreshed from Google Patents.
Patent US4068304A successfully refreshed from Google Patents.
US4068304A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Storage hierarchy performance monitor
Assignee: International Business Machines Corp
•
Filing: 1973-01-02
•
Granted: 1978-01-10
•
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
- 👤 Klim Maling
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 19:32
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0893; G06F12/0897; G06F11/00; G06F11/30; G06F11/34; G06F11/3457; G06F11/3461; G06F11/3409; G06F11/3419; G06F11/3466; G06F11/348; G06F11/3485; G06F2201/00; G06F2201/88
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
210 words
For use with an address stream derived from the operation of a computer with single level storage, an emulation machine for use in determining the average time for completing memory reference operations in a multi-level storage by emulating the operation of said multi-level storage and thereby obtaining data from which said time can be determined, said machine comprising multiple directories for receiving and storing addresses from said address stream, one of said directories provided for each level of said multi-level storage other than the main storage level, each of said directories of a size capable of holding all addresses which the corresponding level in said multi-level storage could contain, comparator means connected to each of said directories for comparing the existing address contents of said directories with successive addresses from said address stream, updating means connected to said directories for updating the existing addresses in said directories as new addresses are received from said address stream, and counting means connected to said comparator means to provide a record of hits (compares) and misses (no compares) for fetch and store memory reference from said address stream at each of said directories whereby data is obtained from which the average time for completing memory references in said multi-level storage can be computed.
Claim 2
Dependent Claim
210 words
For use with an address stream derived from the operation of a computer with single level storage, an emulation machine for use in determining the average time for completing memory reference operations in a multi-level storage by emulating the operation of said multi-level storage and thereby obtaining data from which said time can be determined, said machine comprising multiple directories for receiving and storing addresses from said address stream, one of said directories provided for each level of said multi-level storage other than the main storage level, each of said directories of a size capable of holding all addresses which the corresponding level in said multi-level storage could contain, comparator means connected to each of said directories for comparing the existing address contents of said directories with successive addresses from said address stream, updating means connected to said directories for updating the existing addresses in said directories as new addresses are received from said address stream, and counting means connected to said comparator means to provide a record of hits (compares) and misses (no compares) for fetch and store memory reference from said address stream at each of said directories whereby data is obtained from which the average time for completing memory references in said multi-level storage can be computed.
Claim 3
Dependent Claim
120 words
The machine of claim 1 in which the counting means comprise for the case where a hit has occurred at the first level directory, a first counter for counting fetch reference hits at the first level directory, a second counter and a third counter for counting store reference hits and misses respectively at the second level directory, and for the case where a miss has occurred at the first level directory, a fourth counter for counting fetch reference hits in the second level directory, a fifth counter for counting store reference hits in the second level directory, and a sixth counter for counting misses at the second level directory whereby data is obtained for evaluating a three level storage hierarchy.
Claim 4
Dependent Claim
201 words
Apparatus for emulating an n-level storage heirarchy comprising n-1 storage directories of settable latches in which storage addresses are stored, each one of said directories corresponding to one level of said n-level storage above the main storage level, each of said directories including latches to store all addresses in the corresponding hierarchical level, input means connected to said directories for supplying said directories with a copy of each address in an address stream derived from the operation of a general purpose digital computer with a single level storage, said input means including means for passing addresses generated from CPU activity to the highest level directory where the highest level directory is that directory which corresponds to the smallest, highest speed level of the n-level storage, said input means also including means for first passing addresses generated from I/O activity to a directory corresponding to a lower level of said n-level storage, comparator means connected to said directories for comparing successive addresses from said address stream to addresses stored in said directories, and counting means connected to said comparators to count the number of compares (hits) and n-compares (misses) whereby data is accumulated from which the emulated storage hierarchy can be examined.
Claim 5
Dependent Claim
201 words
Apparatus for emulating an n-level storage heirarchy comprising n-1 storage directories of settable latches in which storage addresses are stored, each one of said directories corresponding to one level of said n-level storage above the main storage level, each of said directories including latches to store all addresses in the corresponding hierarchical level, input means connected to said directories for supplying said directories with a copy of each address in an address stream derived from the operation of a general purpose digital computer with a single level storage, said input means including means for passing addresses generated from CPU activity to the highest level directory where the highest level directory is that directory which corresponds to the smallest, highest speed level of the n-level storage, said input means also including means for first passing addresses generated from I/O activity to a directory corresponding to a lower level of said n-level storage, comparator means connected to said directories for comparing successive addresses from said address stream to addresses stored in said directories, and counting means connected to said comparators to count the number of compares (hits) and n-compares (misses) whereby data is accumulated from which the emulated storage hierarchy can be examined.
Claim 6
Dependent Claim
78 words
The apparatus of claim 3 in which each of said storage directories are associative storage directories whereby said directories are divided into classes and further including a first switch means to set the number of classes and a second switch means to set storage block size, a set of said first and second switches connected to each of said directories so that said apparatus is capable of emulating storage hierarchies in which the various levels are configured differently.
Claim 7
Dependent Claim
31 words
The apparatus of claim 4 wherein a third switch means connected to said directories is provided for selecting a storage philosophy circuit by which the addresses in said directories are updated.
Claim 8
Dependent Claim
38 words
The apparatus of claim 5 in which a duplicate emulation machine is provided in parallel to the first emulation machine so that different configurations of storage level variables can be emulated dynamically from an identical address stream input.
References Cited (Backward Citations)
US3540003A
Cited
US3715728A
Cited
US3685020A
Cited
US3697951A
Cited
US3751645A
Cited
US3728534A
Cited
US3723976A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-01-09 | 1981-07-11 | 1982-01-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-01-09 | 1985-07-11 | 1986-01-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-01-09 | 1989-07-11 | 1990-01-10 | $7700.00 | Window Closed / Lapsed |