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)
Some Mathematical Considerations of Time-Sharing Scheduling Algorithms
Journal of the ACM (JACM)
Resource management for a medium scale time-sharing operating system
Communications of the ACM
The working set model for program behavior
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
Introduction and overview of the multics system
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
System design of a computer for time sharing applications
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
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
On the Apparent Continuity of Processing in a Paging Environment
IEEE Transactions on Computers
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Virtual storage and virtual machine concepts
IBM Systems Journal
| Hi-index | 14.98 |
This short note focuses attention upon techniques for dynamic memory allocation in multiprogrammed systems which employ the addressing mechanisms of paging and segmentation. Here, event indicators and mathematical tools are presented which supply characterizations of the paging and segmentation addressing processes. It is shown that these statistical characterizations form data bases which can be used to derive Bayesian storage allocation algorithms conditionally based upon usage, demand, and processing history. It is argued that these characterizations, and algorithms similar to those constructed here, provide a flexible basis for efficient memory management in multiprogrammed, and by extension, time-shared environments. Although emphasis is directed to managing primary (main) memory residence, the techniques could be extended to govern memory management for a hierarchy of storage devices.