This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
Adaptive algorithms, demand paging, dynamic memory management, multiprogramming, operating systems, paging and segmentation, statistical software characterizations, storage allocation, time-sharing.
Citation:
J.E. Shemer, null Someshwar, C. Gupta, "On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation," IEEE Transactions on Computers, vol. 18, no. 7, pp. 644-651, July 1969, doi:10.1109/T-C.1969.222733
Usage of this product signifies your acceptance of the Terms of Use.