proj2 - Project 2: Page Replacement Algorithm 1. Project...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Project 2: Page Replacement Algorithm 1. Project Description For this project you will be implementing a Page Fault hand- ing routine including a Page Replacement Algorithm. 25 %Swap Space: When a process is forked off you will only give it 1 page (its first page). The remaining pages should be sent to the swap space. The swap space does not currently exist, you will have to create it. For this purpose we can create a file using the JavaFileSys- tem. There should be a single file for the entire system. 25% Swap Space Map: Each process will need a map that describes where in the swap space there pages are stored. 25%Page Fault Handling: On a page fault, the steps of correct swapping out a victim page (if necessary) and in reading in the missing page should be correctly implemented. Remember that during the disk accesses another process should be run. The page tables of both the victim page’s process and the page faulting process need to be updated to show the result. On a page
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/02/2012 for the course CIS 486 taught by Professor Mcsweeney during the Spring '10 term at Syracuse.

Page1 / 2

proj2 - Project 2: Page Replacement Algorithm 1. Project...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online