The document discusses implementing paging algorithms FIFO and LRU in NachOS. The authors tried to implement these algorithms but encountered errors when compiling. They then created user programs and paging-swap programs in Java to test the algorithms. The document also provides an overview of page tables, describing them as the data structure used in virtual memory systems to map virtual addresses to physical addresses with each address space having an associated page table and disk map.

1. NACHOS 2 PRACTICAL PART Carlos Eduardo Triana Sarmiento. Jonathan Alvarado Mata. Obed David Guevara Ibarra.

3. FIFO

4. FIFO second part

5. FIFO Result

6. LRU

7. LRU second part

8. LRU result

9. Page Table A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. Each address space within the system has associated with it a page table and a disk map. Each of these two tables describe an *entire* address space. The page table identifies which pages are in main memory, and in which page frames those pages are located. The disk map identifies where all the pages are on the disk. The entire address space is on the disk, but only a subset of it is resident in main memory.