The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Evaluation techniques for storage hierarchies
Abstract
Increasing speed and size demands on computer systems have resulted in corresponding demands on storage systems. Since it has been generally recognized that the speed and capacity requirements of storage systems cannot be fulfilled at an acceptable costperformance level within any single technology, storage hierarchies that use a variety of technologies have been investigated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Bush, K. A., Kemeny, J. G., & Snell, J. L. (1960) · The American Mathematical Monthly · doi:10.2307/2309264 · Cited by 1,546
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Kilburn, T., Edwards, D. B. G., Lanigan, M. J., & Sumner, F. H. (1962) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1962.5219356 · Cited by 256
Structural aspects of the System/360 Model 85, II: The cache
Liptay, J. S. (1968) · IBM Systems Journal · doi:10.1147/sj.71.0015 · Cited by 236
Cited by
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/277851.277897 · Cited by 1,431
Qureshi, M., & Patt, Y. (2006) · 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) · doi:10.1109/micro.2006.49 · Cited by 1,094
Extendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 659
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (2001) · IEEE Transactions on Computers · doi:10.1109/tc.2001.970573 · Cited by 590
A User-Oriented Software Reliability Model
Cheung, R. C. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.234477 · Cited by 529
Fair Cache Sharing and Partitioning in a Chip Multiprocessor Architecture
Kim, S., Chandra, D., & Solihin, Y. (2004) · doi:10.5555/1025127.1026001 · Cited by 519
Characterizing reference locality in the WWW
Almeida, V., Bestavros, A., Crovella, M., & de Oliveira, A. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568672 · Cited by 464
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/277858.277897 · Cited by 442
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
CFLRU: a replacement algorithm for flash memory
Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J. (2006) · Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems · doi:10.1145/1176760.1176789 · Cited by 385
Operating system support for database management
Stonebraker, M. (1981) · Communications of the ACM · doi:10.1145/358699.358703 · Cited by 382
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
Agarwal, A., Hennessy, J., & Horowitz, M. (1989) · ACM Transactions on Computer Systems · doi:10.1145/63404.63407 · Cited by 304
Principles of Optimal Page Replacement
Aho, A. V., Denning, P. J., & Ullman, J. D. (1971) · Journal of the ACM · doi:10.1145/321623.321632 · Cited by 289
Denning, P. J. (2005) · Communications of the ACM · doi:10.1145/1070838.1070856 · Cited by 277
Predicting whole-program locality through reuse distance analysis
Ding, C., & Zhong, Y. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781159 · Cited by 258
Outperforming LRU with an adaptive replacement cache algorithm
Megiddo, N., & Modha, D. S. (2004) · Computer · doi:10.1109/mc.2004.1297303 · Cited by 243
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3699453
Metadata
- Authors
- Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L.
- Venue
- IBM Systems Journal
- Publisher
- IBM
- Published
- 1970
- Volume
- 9
- Issue
- 2
- Pages
- 78-117
- ISSN
- 0018-8670 (ISSN-L)
- OpenAlex
- W2164705534
- Cited by
- 1,302
- References
- 5
- FWCI
- 47.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.