This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1974 (vol. 23 no. 8)
pp. 870-874
C.C. Yang, Department of Information Sciences, University of Alabama
Two finite automata are devised for modeling two classes of demand paging algorithms. The first one of one input and three outputs models the class of algorithms with a constant amount of allocated space. The second one of one input and six outputs models the class of algorithms with a variable amount of allocated space. Some evaluation techniques are developed following each model. The memory states of the first class algorithm with the Least Recently Used (LRU) replacement policy and the working set model of the second class are recursively defined by strings of the loaded pages. The adopted replacement policy and the state string updating procedure are imbedded in the recursive definition of memory states. Properties of some algorithms are developed to fit the finiteness assumption of a reference string.
Index Terms:
Demand paging algorithm, finite automaton, Least Recently Used replacement policy, memory management, missing page rate, page-fault rate, page-success rate, sequential machine, working set model.
Citation:
C.C. Yang, "On the Modeling of Demand Paging Algorithms by Finite Automata," IEEE Transactions on Computers, vol. 23, no. 8, pp. 870-874, Aug. 1974, doi:10.1109/T-C.1974.224042
Usage of this product signifies your acceptance of the Terms of Use.