Segmentation and the Design of Multiprogrammed Computer Systems
Journal of the ACM (JACM)
Program and Addressing Structure in a Time-Sharing Environment
Journal of the ACM (JACM)
The working set model for program behavior
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Further experimental data on the behavior of programs in a paging environment
Communications of the ACM
Microprogamming under a page on demand strategy
Communications of the ACM
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
SOSP '69 Proceedings of the second symposium on Operating systems principles
Strategies for structuring two level memories in a paging environment
SOSP '69 Proceedings of the second symposium on Operating systems principles
On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation
IEEE Transactions on Computers
Considerations in block-oriented systems design
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Structural aspects of the system/360 model 85: II the cache
IBM Systems Journal
Working set restoration: a method to increase the performance of multilevel storage hierarchies
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Hi-index | 14.98 |
The page-faulting rate is one of the important criteria measuring the performance of a virtual storage under demand paging. In a multiprogrammed and/or time-sharing environment, a job is not expected to be run from the beginning to the end without interruption. In effect, it is segmented into phases and run piecewise. When running in this "segmented mode," a job phase upon initiation will most likely not possess the storage contents left by its preceding job phase (from the same job). Further, a job running in a paging environment at time t has a nonzero probability of referencing information brought to the high-speed store before t. Hence, for a given job, the segmented mode will yield a higher page faulting rate than the "continuous mode" in which the job runs continuously from the beginning to the end. By saving and retrieving its "working ensemble" upon the termination and initiation of a job phase, a job can be made to possess an "apparent continuity" insofar as the storage activity is concerned. The performance of the "apparently continuous" mode is hoped to approximate that of the continuous mode with an insignificant amount of overhead. Based on this observation, a storage organization oriented toward the minimization of overhead, is proposed. Simulation has been done for verification.