Need some help on my final assignment. Got in a motorcycle accident and missed a few class sessions so im behind.
Code
Use the programs in 3530fa13-memory-sim-distribution-131120.zip to analyze some paging algorithms.
Use two methods to generate page streams for this analysis:
The memory reference stream in the file spice.din
A randomly generated stream using the weights {50, 1, 1, 50}
Use the following parameters:
Execution time
Whatever the spice.din file provides
50000 page references for the randomly generated pages
Number of pages needed by the process: 32
Number of frames available for the process: 8
Compare the following page replacement algorithms in each case:
Optimal algorithm
LRU algorithm
Constant algorithm, always evicts the page in frame 0
Random algorith, evicts a randoly chosen page
For each combination of page generation method and algorithm do 5 runs. Collect the results and create a report based on these results.
The report should describe your findings, comparing the randomly generated page stream with the real memory stream and comparing the four algorithms. In support of your discussion, include at least the following:
A summary of the fault ratio for the eight different combinations of page generation method and page replacement algorithm. Use a table for this.
Give a one sentence description of the weights, what is the effect of using those weights?
Is this set of weights more realistic than the ones presented in class? You don’t have to present the data from class, but you should refer to it.
Deliverable
Turn in the report in an appropriate format. You do not have to submit the code.
if you can help i will provide the link to the code above
ill pay all my fg and get more for you or whatever else you want.