NACHOS 2 PRACTICAL PARTCarlos Eduardo Triana Sarmiento. Jonathan Alvarado Mata. Obed David Guevara Ibarra.
Paging AlgorithmsWe tried to implement in nachOS the paging algorithms FIFO and LRU, but we have some errors when compiling. To test our programs of paging algorithms we first madeuserprograms, while we were doing these user programs wehad some errors so we implemented paging-swap programs out of nachOS. So thats why we wrote the paging algorithms in java Here are the two programs (FIFO and LRU).
Page TableA 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.