README.txt file for CSC343 Spring 2024 Assignment 5 on
Page Replacement Algorithms, due via D2L by end of May 9.

STUDENT NAME:

Each answer contributes 10% of the overall project grade.
This like the first 4 projects is worth 20% of your semester grade.
*************************************************************
Q1. Which one of the four page reference distributions in Table 1 --
    gaussian, exponential, revexponential, or uniform -- exhibits the
    worst Locality of Reference in terms of SUM_findVictim cost of
    page replacement? What numeric SUM_findVictim pattern makes you say that?

YOUR ANSWER:

*************************************************************
Q2. Why does the page reference distribution you chose in Q1 exhibit
    the worst Locality of Reference behavior? Refer to one or more of
    Figure 2 through 6 in your answer.

YOUR ANSWER:

*************************************************************
Q3. Which one of the four page reference distributions in Table 1 --
    gaussian, exponential, revexponential, or uniform -- exhibits the
    best Locality of Reference in terms of SUM_findVictim cost of page
    replacement, for a given frameCount value of either 100 or 200?
    What numeric SUM_findVictim pattern makes you say that?

YOUR ANSWER:

*************************************************************
Q4. Why does the page reference distribution you chose in Q3 exhibit the
    best Locality of Reference behavior for a given frameCount value?
    Refer to one or more of Figure 2 through 6 and their discussions
    in your answer.

YOUR ANSWER:

*************************************************************
Q5. Which one of the four page reference distributions in Table 1 --
    gaussian, exponential, revexponential, or uniform -- is the
    least sensitive to the page replacement algorithm used (Optimal,
    FIFO, or LRU)?  What numeric SUM_findVictim pattern makes you say that?

YOUR ANSWER:

*************************************************************
Q6. Which one or more of the four page reference distributions in Table 1
    -- gaussian, exponential, revexponential, or uniform -- give
    greater-than-linear improvements when the frameCount doubles from
    100 to 200? In other words, when frameCount doubles from 100 to 200,
    cost in terms of SUM_findVictim is reduced by more than half. Why do
    it or they give greater-than-linear improvement?

YOUR ANSWER:

*************************************************************
Q7. Which property dominates the minimization of SUM_findVictim for a given
    frameCount value, page replacement algorithm or locality of reference?
    Why? I am not looking for a specific page replacement algorithm like
    (Optimal, FIFO, LRU), nor locality of reference like (gaussian,
    exponential, revexponential, uniform), but rather just
    "page replacement algorithm" OR "locality of reference".
    Justify your answer in terms of Table 1 and optionally the figures.

YOUR ANSWER:

*************************************************************
Q8. Do any of the frameCount increases from 100 to 200 in Table 1 exhibit
    Belady's Anomaly as discussed in Chapter 9 slides? If so, cite an
    example from Table 1 that shows Belady's Anomaly.

YOUR ANSWER:

*************************************************************
Q9. From what value to what value does the translation-lookaside-buffer
    (TLB) register set provide a MAPPING? Why is it important to maintain
    this mapping in a register and not just in the page table of the process?

YOUR ANSWER:

*************************************************************
Q10. What status bit or bits would be added to the TLB to support the LRU
     and LRUDirty page replacement algorithms without forcing the kernel to
     consult the page table on every application memory access?

YOUR ANSWER:

*************************************************************