This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
May 1981 (vol. 30 no. 5)
pp. 341-356
W. Abu-Sufah, Department of Electrical Engineering, Yarmouk University
It is possible to improve the paging performance of a program by applying transformations to the source program that improve data access locality. We discuss this subject in general terms, including automation of these transformations, and present a number of such transforms. This is followed by experimental results which indicate that these transformations are indeed effective. Use of practical, simple memory management policies like the fixed allocation local lru replacement algorithm leads to average improvements over untransformed programs of a factor of 10 in space-time cost, and a factor of 5 in memory size. Multiprogramming questions are also discussed.
Index Terms:
virtual memory, Optimizing compiler, program behavior, program transformation
Citation:
W. Abu-Sufah, D.J. Kuck, D.H. Lawrie, "On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations," IEEE Transactions on Computers, vol. 30, no. 5, pp. 341-356, May 1981, doi:10.1109/TC.1981.1675792
Usage of this product signifies your acceptance of the Terms of Use.