Abstract :
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.
Keywords :
Demand paging, matrix algorithm, multiprogramming, paging performance, prepaging, virtual memory.; Computer science; Cost function; Yttrium; Demand paging, matrix algorithm, multiprogramming, paging performance, prepaging, virtual memory.;
