Final Project

advertisement
CSCI 3380 Computer Architecture Team Project
(4 people / team)
Page Replacement Algorithms
Project Objective: in completing this project, you will
 Fully understand the page replacement mechanisms
 Be able to simulate operating system on page replacement works
You need to implement the following page replacement algorithms:
1. FIFO
2. Optimal
3. Least Recently Used
4. Second Chance
5. Least Frequently Used
6. Chose another page replacement algorithm other than (1), (2),
(3), (4), (5). Each team needs to have different algorithms. Once
you decide your algorithm, come to see me and provide me
your team list as well as your algorithm.
Due Dates and Honor:
This project will be due by the beginning of the class on 4/19, 2012.
This is a team-independent programming project, and it is very important
that you understand and abide by the policy concerning programming
projects. Remember, your personal honor and integrity is far more
important than your grade on the project.
Detail Instructions:
STEP 1:
Describe the 6th algorithm you implemented in understandable English and a
short example.
STEP 2:
After you finished the coding of page replacement algorithms, firstly, apply
it to the following input sequence:
1
2
3
4
1
2
5
1
2
3
4
5
(This is the input sequence used in the class example)
For each algorithm, you need to print out the detail process page
replacement with 3 and 4 frames by your program.
For example,
FIFO (3 Frame)
Page 1
2 3
#
1
1 1
2
4
1
2
5
4
4
4
2
2
1
3
3
1
2
3
4
5
5
5
5
1
1
3
3
3
2
2
2
4
1
2
5
1
2
3
4
5
1
5
5
5
5
4
4
2
2
2
1
1
1
1
5
3
3
3
3
2
2
2
2
4
4
4
4
3
3
3
Number of page fault: 9
FIFO (4 Frame)
Page 1 2 3
#
1 1 1
2
4
Number of page fault: 10
Do the same procedure with all 6 algorithms.
STEP 3:
Apply all algorithms on the given input sequence file with 3, 4, 5, 6, and 7
frames. Do not print out the detail process page replacement. Record the
page fault number and present the result in graphical way for all algorithms.
(You can print out the figure by Excel) Such as:
What to Submit:
 A report of your project including Step 1, Step 2 and Step 3.
 Hard copy of your source code.
 A 10 minutes power-point presentation to explain the algorithm you
choose (please do not explain the algorithms I taught in the class) and
your group’s comparison result.
Download