Week 4 - CST 334

 This week we learned about paging, which is how the OS manages memory. Paging is when memory is broken down into pages of a certain size to avoid problems like fragmentation. We also learned about page tables, which is how pages are kept track of and holds all address translations. Sometimes, it is quicker to translate addresses by using the translation-lookaside buffer, which is a cache of popular translations, that access the page table. Sometimes page tables can become too large and use too much memory. Solutions to this include using a hybrid system of paging and segmentation or multilevel page tables Finally, we learned about the policies an OS uses to evict pages from memory when it becomes full. A few of them include Optimal Replacement, FIFO and LRU. FIFO will remove the pages from the cache in order of oldest to most recent. Optimal Replacement would replace the page that will be used the furthest in the future. LRU will evict the page that hasn't been access for the longest time.