Efficient Stack Distance Computation for a Class of Priority Replacement Policies
- 20 July 2012
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (3) , 430-468
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On approximating the ideal random access machine by physical machinesJournal of the ACM, 2009
- MamboACM SIGMETRICS Performance Evaluation Review, 2004
- Calculating stack distances efficiently2002
- LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policiesIEEE Transactions on Computers, 2001
- An optimality proof of the LRU- K page replacement algorithmJournal of the ACM, 1999
- Active memoryACM SIGMETRICS Performance Evaluation Review, 1995
- A model for hierarchical memory1987
- Some Distribution-Free Aspects of Paging Algorithm PerformanceJournal of the ACM, 1974
- A model of memory contention in a paging machineCommunications of the ACM, 1972
- Dynamic storage allocation in the Atlas computer, including an automatic use of a backing storeCommunications of the ACM, 1961