The actual page that is overwritten is the page at the head of the free page list. When the maximum number of pages in the modified page list is reached some of them are written to memory and are then moved to the free page list. If a page fault occurs and that page is in the free page list or the modified page list then that page is moved to the tail of the process' resident set list. This is bad because with FIFO the oldest page is swapped out and this might be a page that is used a lot so it will be continually swapped out and faulted in. This is bad because this uses a large amount of memory that could be used to increase processes' resident set list size.
Access time is the time from when a read or write request is issued to when data transfer begins.
Average rotational latency time is one half of the time for a full rotation of the disk. 4 points With twice as much memory the mean time between page faults will double thus there will be half as many page faults. The program would now take 45 sec to run. They will be collected at the beginning of class. Please staple multiple sheets together.