Abstract
The linear approximation relating mean time between page transfers between levels of memory, as reported by Saltzer for Multics, is examined. It is tentatively concluded that this approximation is untenable for main memory, especially under working set policies; and that the linearity of the data for the drum reflects the behavior of the Multics scheduler for background jobs, not the behavior of programs.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference7 articles.
1. A simple linear model of demand paging performance
2. Dynamic space-sharing in computer systems
3. A page allocation strategy for multiprogramming systems with virtual memory;Chamberlin D. D.;IBM T. J. Watson Research Center Report RC,1972
4. The lifetime function shape and the optimal memory allocation;Ghanem M. Z.;IBM T. J. Watson Research Center Report,1973