[Q.1] Answer the following questions
a) (2 points) Explain the advantage(s) of the busy waiting (spinlock) in multicore computing
systems
[Q.2] Virtual Memory
Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming three
frames? Remember that all frames are initially empty, so your first unique pages will cost one
fault each.
a) (4 points) LRU replacement
b) (4 points) FIFO replacement
c) (4 points) Optimal replacement