CSC 453 - Operating Systems

Dr. R. M. Siegfried

Assignment #8 - Virtual Memory replacement algorithms

Due Wednesday, April 17, 2024

  1. Given the following sequence for page references:
    1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2
    and the frequently of use (for LFU and MFU):
    Page Number Count
    1 876
    2 234
    3 789
    4 312
    5 340
    6 181
    7 633
    8 511
    9 444

    Assume that you have 3 frames available. Show how the pages would be loaded into frames assuming the following replacement algorithms:
    1. Optimum
    2. FCFS (First Come First Serve)
    3. LRU (Least Recently Used)
    4. LFU (Least Frequently Used)
    5. MFU (Most Frequently Used)

  2. Assume that Δ= 4, how many frame will this process be allocated?

[Back to the Assignments Index]