Nachos 2 Practical Part

344 views
303 views

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
344
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
3
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • aqui le quiero agregar info no se ustedes.  Info de q? No corrijas mi inglés de konan, ese es el chido :)
  • Nachos 2 Practical Part

    1. 1. NACHOS 2  PRACTICAL PART Carlos Eduardo Triana Sarmiento. Jonathan Alvarado Mata. Obed David Guevara Ibarra.
    2. 2. Paging Algorithms <ul><li>We tried to implement in nachOS the paging algorithms FIFO and LRU, but we have some errors when compiling. </li></ul><ul><li>To test our programs of paging algorithms we first made userprograms, while we were doing these user programs we had some errors so we implemented paging-swap programs out of nachOS. </li></ul><ul><li>So that's why we wrote the paging algorithms in java  </li></ul><ul><li>Here are the two programs (FIFO and LRU). </li></ul>
    3. 3. FIFO
    4. 4. FIFO second part
    5. 5. FIFO Result
    6. 6. LRU
    7. 7. LRU second part
    8. 8. LRU result
    9. 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.
    10. 11. Page Table <ul><li>  </li></ul>
    11. 12. Page Table result <ul><li>  </li></ul>

    ×