[solved]-Write Program C Python Preferably Python Simulate Least Recently Used Lru Page Replacement Q39012408

Write a program (In c++ or python but preferablypython) to simulate the Least-Recently-Used (LRU) PageReplacement Algorithm that appears on page 366 of the textbook. Inparticular, the simulator should accept the following input fromstandard input (stdin):

Number of Virtual Pages
Number of Page Frames Available (not used by page table)
Number of References
Page Referenced   Read or Write (0 or 1,respectively)   duration
Page Referenced   Read or Write (0 or 1,respectively)   duration

For example:

          5
          3
          2
          0 0 2
          1 1 1
          3 0 1

is valid input. There are 5 virtual pages (numbered 0, 1, …4), 3 page frames (numbered 0, 1, 2) in memory, 3 referenceslisted: page 0 is read from for 2 clock ticks, page 1 is written tofor 1 clock tick, and page 3 is read from for 1 clock tick.

Maintain a page table as an array. Use page number as an indexto the array. The array should include an R-bit, an M-bit, and aPresent/Absent bit, as well as the frame currently mapped.

R-bit = 1 if page has been referenced recently(read/write)
M-bit = 1 if page has been modified (needs to be written todisk)

Corresponding to the previous example, the page table could looklike this way:

       1 0 1 0
       1 1 1 1
       0 0 0 0
       1 0 1 2
       0 0 0 0

The first row indicates the virtual page 0 is mapped to thephysical page 0. The page has been referenced and is present in thephysical memory.

Assume that the R-bit is reset to 0 after a set of 6 pages havebeen referenced. This is to simulate a reset after each clockinterrupt.

The output from the simulator should indicate whenever a faultoccurs, and which page has been evicted (if one is evicted). Alwaysselect the smallest numbered page in a class to be evicted. Inaddition, the output should include the total number of faults thatoccurred.

The possible output would look something like:

                   : :
           Fault: no page evicted, page 0 brought in to memory.
           Fault: page 2 evicted, page 3 brought in to memory.
                   : :
           Total number of faults is 23.

Expert Answer

---

Answer to Write a program (In c++ or python but preferably python) to simulate the Least-Recently-Used (LRU) Page Replacement Algo… . . .