John W. McCredie
ABSTRACT
Systems analysts are designing algorithms to reduce the large overhead costs of present paging schemes in virtual memory computer systems. In this paper an analytic and a simulation model expose serious deficiencies of a well known definition of a “bad replacement” in such systems. The use of this complex definition to evaluate replacement rules can actually lead to degraded performance. A simpler definition is proposed. The analysis indicates that for the class of problems studied, simulation techniques appear to have advantages over probabilistic models.
- 1.Belady, L. A., "A study of replacement algorithms for a virtual-storage computer," IBM Systems Journal, Vol. 5, No. 2, pp.78-101, 1966.Google Scholar
Digital Library
- 2.Coffman, E. G., and Varian, L. C., "Further experimental data on the behavior of programs in a paging environment," Communications of the ACM, Vol. 11, No. 7, pp.471-474, 1968. Google ScholarDigital Library
- 3.Denning, P. J., "The working set model for program behavior," Communications of the ACM, Vol. 11, No. 5, pp.323-333, 1968. Google ScholarDigital Library
- 4.Denning, P. J., "Thrashing: its causes and prevention," Proceedings Fall Joint Computer Conference, Vol. 33, Part 1, pp.915-922, 1968.Google Scholar
- 5.Feller, W., An Introduction to Probability Theory and its Applications, Vol. 1, John Wiley and Sons, New York.Google Scholar
- 6.Fine, G., Jackson, C., McIssac, P., "Dynamic program behavior under paging," Proceedings National ACM, pp.223, 1966. Google ScholarDigital Library
- 7.Kuehner, C. J., Randell, B., "Demand paging in perspective," Proceedings Fall Joint Computer Conference, Vol. 33, Part II, pp. 1011-1018, 1968.Google Scholar
- 8.Nielsen, N. R., "The simulation of time-sharing systems," Communications of the ACM, Vol. 10, No. 7, pp.397-412, 1967. Google ScholarDigital Library
- 9.Saltzer, J. H., Traffic Control in a Multiplexed Computer System, M.I.T., Project MAC Tech. Report MAC-TR-30, M.I.T., Cambridge, Mass., 1966. Google ScholarDigital Library
- 10.Univac, Simula Programmers Reference, UP-7556, Sperry Rand Corporation, 1967.Google Scholar
Index Terms
- Measurement criteria for virtual memory paging rules
Recommendations
Efficient Remote Memory Paging for Disaggregated Memory Systems
Algorithms and Architectures for Parallel ProcessingAbstractMemory disaggregation has attracted increasing attention in recent years because it is a cost-efficient approach to scale memory capacity for applications in a data center. However, the latency of remote memory access is a major concern in ...
Failure-Atomic Slotted Paging for Persistent Memory
ASPLOS '17The slotted-page structure is a database page format commonly used for managing variable-length records. In this work, we develop a novel "failure-atomic slotted page structure" for persistent memory that leverages byte addressability and durability of ...
Energy-aware flash memory management in virtual memory system
The traditional virtual memory system is designed for decades assuming a magnetic disk as the secondary storage. Recently, flash memory becomes a popular storage alternative for many portable devices with the continuing improvements on its capacity, ...
Comments