Homework Operating Systems Chapter 8~9 1 Give the methods that are used in page table and TLB for searching the accessing pages. Compare the differences on the searches between these two hardwares and give reasons why TLB will help the search of the pages. 2 Consider a 32bit address space with 2K bytes page size, assuming that each entry consists of 4 bytes, how much memory are required for the page table for each process? Explain your reason. 3 Evaluate FIFO, LRU, Second-Chance (Clock) and OPT page replacement algorithm by running it on the memory reference string below and completing the tables provided. Compare the number of page faults resulted. Reference string: 473345437 FIFO Clock LRU LFU Homework Operating Systems Chapter 8~9 1 Give the methods that are used in page table and TLB for searching the accessing pages. Compare the differences on the searches between these two hardwares and give reasons why TLB will help the search of the pages. 2 Consider a 32bit address space with 2K bytes page size, assuming that each entry consists of 4 bytes, how much memory are required for the page table for each process? Explain your reason. 3 Evaluate FIFO, LRU, Second-Chance (Clock) and OPT page replacement algorithm by running it on the memory reference string below and completing the tables provided. Compare the number of page faults resulted. Reference string: 473345437 FIFO Clock LRU LFU