Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Operating Systems Theory
Prepaging and applications to structured array problems.
Prepaging and applications to structured array problems.
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Post-copy live migration of virtual machines
ACM SIGOPS Operating Systems Review
| Hi-index | 14.99 |
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.