Affiliation:
1. IBM Thomas J. Watson Research Center, Yorktowm Heights, NY
Abstract
The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running time.
An informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented.
Publisher
Association for Computing Machinery (ACM)
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. FIFO queues are all you need for cache eviction;Proceedings of the 29th Symposium on Operating Systems Principles;2023-10-23
2. CARL: Compiler Assigned Reference Leasing;ACM Transactions on Architecture and Code Optimization;2022-03-17
3. Working Set Analytics;ACM Computing Surveys;2021-11-30
4. RC-RNN: Reconfigurable Cache Architecture for Storage Systems Using Recurrent Neural Networks;IEEE Transactions on Emerging Topics in Computing;2021
5. Memory allocation anomalies in high‐performance computing applications: A study with numerical simulations;Concurrency and Computation: Practice and Experience;2020-11-23