Your SlideShare is downloading. ×
0
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Nachos 2 Practical Part
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Nachos 2 Practical Part

258

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
258
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
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 :)
  • Transcript

    • 1. NACHOS 2  PRACTICAL PART Carlos Eduardo Triana Sarmiento. Jonathan Alvarado Mata. Obed David Guevara Ibarra.
    • 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. 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.
    • 10.  
    • 11. Page Table <ul><li>  </li></ul>
    • 12. Page Table result <ul><li>  </li></ul>

    ×