After execution We compare our results with Rinard notes. In this case we found an error in Rinard notes when page 4 enter in memory.
LRUThis is the code of ourimplementation ofLRU algorithm.The principaldifference is that wemove the pagerequired to the end ofthe array of elementsfor know what page isthe most recentlyused.
After execution Again we compare our results with Rinard notes.In the execution of theprogram you see a zero in thefirsts 3 lines, it means thatisnt any page inthat position in the memory.
FIFO vs LRU The difference is in the efficiency of each algorithm to avoid a greater number of page faults. Comparing these two types of algorithms can be summarized that the number of page faults in the FIFO is greater than the LRU.
Virtual memoryThe relation between virtualaddresses and physical memoryaddresses given by a page table.
TLBTranslation lookaside buffer is a CPU cache that memorymanagement hardware uses to improve virtual address translationspeed. All current desktop and server processors use a TLB tomap virtual and physical address spaces, and it is ubiquitous inany hardware which utilizes virtual memory.