This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms
January 1981 (vol. 7 no. 1)
pp. 122-131
R.L. Budzinski, Central Research Laboratory, Texas Instruments, Inc.
In this paper we compare the performance of virtual memory allocation algorithms. The primary measure of performance is the space-time product of primary memory occupancy, or space-time cost, used by a program during its execution. Using DMIN, an optimal dynamic aliocation algorithm, we compute the minimum space-time cost achievable for some benchmark program runs. We compare the DMIN space-time cost with the space-time cost from: MIN, an optimal static allocation algorithm, VMIN, an optimal variable space algorithm, and two heuristic dynamic allocation algorithms. the page fault frequency algorithm and the damped working set algorithm.
Index Terms:
working set algorithms, DMIN algorithm, dynamic memory, MIN algorithm, page fault frequency algorithm, space-time cost, virtual memory
Citation:
R.L. Budzinski, E.S. Davidson, "A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms," IEEE Transactions on Software Engineering, vol. 7, no. 1, pp. 122-131, Jan. 1981, doi:10.1109/TSE.1981.234515
Usage of this product signifies your acceptance of the Terms of Use.