This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Prepaging and Applications to Array Algorithms
September 1976 (vol. 25 no. 9)
pp. 915-921
K.S. Trivedi, Department of Computer Science, Duke university
A demand prepaging algorithm DPMIN is defined and proved to be an optimal demand prepaging algorithm. However, it cannot be used in practice since it requires that the future refreence string be completely known in advance. Several practical prepaging algorithms are also defined which require only a partial knowledge of the future reference string. Finally, we show that these prepaging algorithms reduce the paging problems of array algorithms operating on large arrays.
Index Terms:
Demand paging, matrix algorithm, multiprogramming, paging performance, prepaging, virtual memory.
Citation:
K.S. Trivedi, "Prepaging and Applications to Array Algorithms," IEEE Transactions on Computers, vol. 25, no. 9, pp. 915-921, Sept. 1976, doi:10.1109/TC.1976.1674716
Usage of this product signifies your acceptance of the Terms of Use.