Electronic Resource
Springer
Acta informatica
17 (1982), S. 101-120
ISSN:
1432-0525
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Summary The design and evaluation of a prepaging technique is presented. It consists in the preloading, at instants at which page-faults occur, of those pages whose use in the future is the most likely. These pages are determined as a function of an a-priori knowledge of program behavior. We shall first present two tools for predicting that behavior. The first is based on a Markov memory reference transition model, the second on a semi-Markov model of page-fault transitions. Both methods are successively experimented by a paging algorithm allowing prepaging. Experimentation shows that prepaging can significantly improve the performance of the paging algorithm, especially when the prediction is based on the transitions between page-faults. The sensitivity of prepaging performance to various working conditions is tested. Implementation of prepaging is examined and is shown to be feasible without the use of special hardware devices. The study is completed by an evaluation of the influence of prepaging on global system performance. Some common cases of system architecture experimentation show a non-negligible increase in CPU utilization.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00262979
Permalink
|
Location |
Call Number |
Expected |
Availability |
