Program and Addressing Structure in a Time-Sharing Environment
Journal of the ACM (JACM)
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM - Special 25th Anniversary Issue
A simple linear model of demand paging performance
Communications of the ACM
Execution characteristics of programs in a page-on-demand system
Communications of the ACM
Demand paging through utilization of working sets onr the MANIAC II
Communications of the ACM
Communications of the ACM
Comment on multiprogramming under a page on demand strategy
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Dynamic space-sharing in computer systems
Communications of the ACM
Degree of multiprogramming in page-on-demand systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
An anomaly in space-time characteristics of certain programs running in a paging machine
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Performance monitoring in a time-sharing system
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
EINSTEIN: an internal driver in a time-sharing environment
ACM SIGOPS Operating Systems Review
The VMOS paging algorithm: a practical implementation of the working set model
ACM SIGOPS Operating Systems Review
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Measurement criteria for virtual memory paging rules
ACM '69 Proceedings of the 1969 24th national conference
Measurement and analysis of a demand paging Time Sharing System
ACM '69 Proceedings of the 1969 24th national conference
Machine organization for multiprogramming
ACM '67 Proceedings of the 1967 22nd national conference
The SDC Time-Sharing System revisited
ACM '67 Proceedings of the 1967 22nd national conference
Simulation studies of a virtual memory, time-shared, demand paging operating system
SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
Sim/61: A simulation measurement tool for a time-shared, demand paging operating system
Proceedings of the SIGOPS workshop on System performance evaluation
Page size in demand-paging systems
SIGME '73 Proceedings of the 1973 ACM SIGME symposium
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
The working set model for program behavior
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
An empirical study of the behavior of programs in a paging environment
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Simulation studies of a virtual memory, time-shared, demand paging operating system
ACM SIGOPS Operating Systems Review
Performance prediction of a virtual machine
ACM SIGMETRICS Performance Evaluation Review
Performance of a virtual memory: some experimental results
ACM SIGMETRICS Performance Evaluation Review
On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation
IEEE Transactions on Computers
An Adaptive Replacement Algorithm for Paged-Memory Computer Systems
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
On the Apparent Continuity of Processing in a Paging Environment
IEEE Transactions on Computers
Bulk core in a 360/67 time-sharing system
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Interactive systems: promises, present and future
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Thrashing: its causes and prevention
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Program behavior in a paging environment
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
The dynamic behavior of programs
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Operating systems architecture
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
The ADEPT-50 time-sharing system
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
The page fault frequency replacement algorithm
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Virtual storage and virtual machine concepts
IBM Systems Journal
Some principles of time-sharing scheduler strategies
IBM Systems Journal
An analysis of page allocation strategies for multiprogramming systems with virtual memory
IBM Journal of Research and Development
| Hi-index | 0.23 |
In May, 1965, System Development Corporation (SDC) proposed to do some research to study program organization with respect to dynamic program behavior. Further, the proposal suggested that simulation techniques might be used to study the problem of resource allocation in a multiprocessor time-sharing system. Some of the reasons for the proposal related to the prospective utilization of the time-sharing hardware features of the GE and IBM time-sharing computers. At the time, there was considerable interest in investigating the concepts of program segmentation and page turning, both at SDC and in the time-sharing community at large. The concept of fixed-size paging on demand particularly, raised some questions of practicality. One of the early papers on the subject by Dennis and Glaser1 states that the concept of page-turning can be either useful or disastrous, depending on the class of information to which it is applied. However, the theory appeared to be both advantageous and elegant, so that the future of time-sharing seemed to be committed to the concept.