|Title||Prepaging and Applications to Array Algorithms|
|Publication Type||Journal Article|
|Year of Publication||1976|
|Journal||Ieee Transactions on Computers|
|Pagination||915 - 921|
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 reference 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. Copyright © 1976 by The Institute of Electrical and Electronics Engineers, Inc.
|Short Title||Ieee Transactions on Computers|