1 Using a random function to construct the page request sequence, the resequences must not be less than 1000 page requests, and the random sequence is analyzed to analyze the number of different page sides, the advanced existing (FIFO) page replacement algorithm and the least least use plans algorithm The hit rate of (LRU), compared with the optimal replacement algorithm 2, 2 not less than 1000 specific sequences, sequential procedures and cyclic program sequences
OBJECTIVE: To observe different plans, allocate different page numbers, different request sequences on computer hit rate, can further improve, dynamically call suitable replacement algorithms according to the occurrence sequence
