article

A study of replacement algorithms for a virtual-storage computer

Author:

L. A. BeladyAuthors Info & Claims

IBM Systems Journal, Volume 5, Issue 2

Pages 78 - 101

https://doi.org/10.1147/sj.52.0078

Published: 01 June 1966 Publication History

Abstract

This study is based on a virtual-storage concept that provides for automatic memory allocation.

Several algorithms for the replacement of current information in memory are evaluated.

Discussed is the simulation of a number of typical program runs using differing replacement algorithms with varying memory size and block size. The results are compared with each other and with a theoretical optimum.

References

[1]

T. Kilburn, D. B. G. Edwards, M. J. Lanigan, and F. H. Sumner, "One level storage system," IRE Transactions on Electronic Computers EC-11, No. 2, 223-235 (1962).

Crossref

Google Scholar

[2]

L. P. Horwitz, R. M. Karp, R. E. Miller, and S. Winograd in "Index register allocation," ACM Journal 13, No. 1, 43-61 (January 1966).

Digital Library

Google Scholar

Cited By

View all

Wong DWu HMolder CGunasekar SLu JKhandkar SSharma ABerger DBeckmann NGanger GMa XWon Y(2024)BaleenProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650718(347-372)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650718
Lo CMarina MSastry NXu KFadaei SLi Y(2024)Shrinking VOD Traffic via Rényi-Entropic Optimal TransportACM SIGMETRICS Performance Evaluation Review10.1145/3673660.365508152:1(75-76)Online publication date: 13-Jun-2024
https://dl.acm.org/doi/10.1145/3673660.3655081
Lo CMarina MSastry NXu KFadaei SLi YGaretto MMarin ACiucu FFanti GRighter R(2024)Shrinking VOD Traffic via Rényi-Entropic Optimal TransportAbstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems10.1145/3652963.3655081(75-76)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3652963.3655081
Show More Cited By

Recommendations

Counter-Based Cache Replacement and Bypassing Algorithms

Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large, motivating the design of alternative replacement algorithms to improve ...
Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniques

The replacement policies for the last-level caches (LLCs) are usually designed based on the access information available locally at the LLC. These policies are inherently sub-optimal due to lack of information about the activities in the inner-levels of ...
Buffer Replacement Algorithms for Multimedia Storage Systems
ICMCS '96: Proceedings of the 1996 International Conference on Multimedia Computing and Systems

In a disk-based storage system, a buffer cache is used to reduce the number of disk I/O. The buffer manager is responsible for buffer replacement to free memory in order to accommodate new data blocks from disk. An optimal buffer replacement algorithm ...

Comments

Information & Contributors

Information

Published In

IBM Systems Journal Volume 5, Issue 2

June 1966

63 pages

ISSN:0018-8670

Issue’s Table of Contents

Publisher

IBM Corp.

United States

Publication History

Published: 01 June 1966

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

662
Total Citations
View Citations
14
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wong DWu HMolder CGunasekar SLu JKhandkar SSharma ABerger DBeckmann NGanger GMa XWon Y(2024)BaleenProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650718(347-372)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650718
Lo CMarina MSastry NXu KFadaei SLi Y(2024)Shrinking VOD Traffic via Rényi-Entropic Optimal TransportACM SIGMETRICS Performance Evaluation Review10.1145/3673660.365508152:1(75-76)Online publication date: 13-Jun-2024
https://dl.acm.org/doi/10.1145/3673660.3655081
Lo CMarina MSastry NXu KFadaei SLi YGaretto MMarin ACiucu FFanti GRighter R(2024)Shrinking VOD Traffic via Rényi-Entropic Optimal TransportAbstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems10.1145/3652963.3655081(75-76)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3652963.3655081
Liu KWu KWang HZhou KWang PZhang JLi C(2024)SLAP: Segmented Reuse-Time-Label Based Admission Policy for Content Delivery Network CachingACM Transactions on Architecture and Code Optimization10.1145/364655021:2(1-24)Online publication date: 9-Feb-2024
https://dl.acm.org/doi/10.1145/3646550
Koo KKim SKim WChoi YHan JKim BMoon B(2024)PreVision: An Out-of-Core Matrix Computation System with Optimal Buffer ReplacementProceedings of the ACM on Management of Data10.1145/36392972:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639297
Lo CMarina MSastry NXu KFadaei SLi Y(2024)Shrinking VOD Traffic via Rényi-Entropic Optimal TransportProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36390338:1(1-34)Online publication date: 21-Feb-2024
https://dl.acm.org/doi/10.1145/3639033
Vanerio JHügerich LSchmid S(2024)Tero: Offloading CDN Traffic to Massively Distributed DevicesProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631556(186-198)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631556
Torabi HKhazaei HLitoiu MBalsamo SKnottenbelt WAbad CShang W(2024)A Learning-Based Caching Mechanism for Edge Content DeliveryProceedings of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629526.3645037(236-246)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629526.3645037
Lu XLong BChen XHan YSun XTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)ACES: Accelerating Sparse Matrix Multiplication with Adaptive Execution Flow and Concurrency-Aware Cache OptimizationsProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651381(71-85)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620666.3651381
Chang CHan JSivasubramaniam ASharma Mailthody VQureshi ZHwu WTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)GMT: GPU Orchestrated Memory Tiering for the Big Data EraProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651353(464-478)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620666.3651353
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Counter-Based Cache Replacement and Bypassing Algorithms

Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches

Buffer Replacement Algorithms for Multimedia Storage Systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations