Question

for the following reference stream, earnrearnear, draw the page fault time line for fifo, lfu, lru, min page replacement algorithms, assuming three physical pages. use the page with the smallest page number in the case of a tie. (4pts)

Answer 1

Computer memory systems are advancing much more slowly than computer CPUs.

As time goes on, more and more programs' performance will be constrained by the system's memory bandwidth rather than by the CPU's computing power.

As an extreme example, several modern high-end computers only operate at 4-5% of their rated peak speeds when doing simple arithmetic kernels for out-of-cache operands. This means that they spend 95–96% of their time idle while they wait for cache misses to be satisfied. To ensure that the results are (supposedly) more representative of the performance of very big, vector-style programs, the STREAM benchmark was particularly created to work with datasets substantially larger than the available cache on any given system.

Learn more about system here-

https://brainly.com/question/13992507

#SPJ4