Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Dynamic storage allocation systems
Communications of the ACM
Properties of the working-set model
SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
The impact of overload conditions on computer network reliability
Information Processing Letters
Some Results on Distribution-Free Analysis of Paging Algorithms
IEEE Transactions on Computers
Two-Level Replacement Decisions in Paging Stores
IEEE Transactions on Computers
Optimal control of demand-paging systems
Information Sciences: an International Journal
An Interview with Erol Gelenbe
Ubiquity
Investigation of the reliability of multiserver computer networks
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
Cache location in tree networks: preliminary results
INOC'11 Proceedings of the 5th international conference on Network optimization
Erol gelenbe's career and contributions
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Power Savings in Packet Networks via Optimised Routing
Mobile Networks and Applications
Performance evaluation of the random replacement policy for networks of caches
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Fluid limit analysis of FIFO and RR caching for independent reference models
Performance Evaluation
Resilience and security of opportunistic communications for emergency evacuation
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
Estimating instantaneous cache hit ratio using Markov chain analysis
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 14.99 |
The replacement problem arises in computer system management whenever the executable memory space available is insufficient to contain all data and code that may be accessed during the execution of an ensemble of programs. An example of this is the page replacement problem in virtual memory computers. The problem is solved by using a replacement algorithm that selects code or data items that are to be removed from executable memory whenever new items must be brought in and no more free storage space remains. An automaton theoretic model of replacement algorithms is introduced for the class of ``random partially preloaded'' replacement algorithms, which contain certain algorithms of practical and theoretical interest. An analysis of this class is provided in order to evaluate their performance, using the assumption that the references to the items to be stored are identically distributed independent random variables. With this model, it is shown that the well-known page replacement algorithms FIFO and RAND yield the same long-run page-fault rates.