W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In AFIPS Conf. Proc., 1972.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....places pages in frames on the faulting node. 4.1.7 The Basic Algorithm with PFF Borrowing The basic algorithm with borrowing depends on the free queue running dry to initiate a borrowing operation. The PFF (page fault frequency) borrowing algorithm, inspired by traditional PFF replacement [CO72] is an attempt at detecting when borrowing should occur before the free queue becomes empty. The page fault frequency of a node is calculated by the pageout daemon by dividing the number of page fetches that have occurred since the daemon ran two times ago by the real time that elapsed over the ....

W.W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In Proceedings of the 1972 AFIPS Conference, volume Vol. 264 41, AFIPS Press, pages 597--609, 1972.

....trace consists of the remaining accesses. In the second method, the compacted trace consists of a two tuple for each access that remain after deletion. A two tuple is composed of the address accessed and the increment of the time counter needed in time dependent memory management algorithms [14, 22]. Figure 7 gives examples of stack deletion. T k denotes the reduced trace of deletion parameter k. The number of misses observed in time independent processing of the original trace T for memory sizes of 1, 2, 3, and 4 is (12, 10, 8, 4) and similarly for T 2 , T 3 , and T 4 we obtain (13, 10, ....

W.W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In Proceedings of Fall Joint Computing Conference, 1972.

....methods used therefore will be described in section 4. The management of each site s workingset al..so leads to many interesting algorithms, which are comparable to algorithms used for virtual memory management, for example LRU, LFU or the page fault frequency (PFF) algorithm of Chu and Opderbeck [5]. Concerning the implementation of replication heuristics, a process group approach [4] seems to be appropriate, since replicas of a certain object can be managed by a group of dedicated processes, and information needed by the replication heuristic can be exchanged by means of group multicast. ....

Chu, W. W., and Opderbeck, H. The Page Fault Frequency Replacement Algorithm. In AFIPS Conference Proceedings, Fall Joint Computer Conference (1972), vol. 41, pp. 597--609.

....secondary storage. A strict implementation of the working set model is expensive because it requires handling pages in LRU order. A more viable approach is to sample periodically the reference bits of the pages used by each application. This approach is adopted by the page fault frequency policy [23] and the variable interval sampled working set policy [31] Belady [7] suggests that a page replacement policy be as simple as FIFO or random selection with some, but not too much, past access history. The overhead of handling much historical data may have adverse effects. Clock and FIFO with ....

Wesley W. Chu and Holger Opderbeck. The page fault frequency replacement algorithm. In AFIPS Fall Joint Computer Conference Proceedings, pages 597--609, 1972.

No context found.

W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In AFIPS Conf. Proc., 1972.

No context found.

W. Chu and H. Opderbeck, "The Page Fault Frequency Replacement Algorithm," Proc. 1972 AFIPS Fall Joint Computer Conf., Vol 41, AFIPS Press, Montvale, NJ, Dec. 1972.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC