{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

aa3-sol - Problem Set 3 solutions Due March 28 Instructions...

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

View Full Document Right Arrow Icon
Problem Set 3 solutions Due: March 28 cs2me3 Winter 2007 Instructions 1. You are encouraged to work in groups of two. If you cannot find a partner, you can work alone. 2. Please submit one copy of the assignment; if you are working with a partner, both names should appear on the assignment. 3. For Part A of the assignment, you must submit an electronic copy of your Java appli- cation via WebCT (by the time of the lecture on the due date of the assignment). Part A Write a program which does the following experiment: on input m, n, k it creates a random list of m requests, where each request is from among [ n ] = { 1 , 2 , . . . , n } pages of memory, and it counts the number of misses on a cache of size i k of each of the following page replacement algorithms: LRU, CLOCK, FIFO, LIFO, LFU, LFD 1 , and plots the result. In other words, for each 0 < i k it draws a point in position ( i, misses A ( i )), the number of misses on a cache of size i on algorithm A . (For a better visual effect, plot the outcome of each algorithm in a different color, and provide a legend.)
Background image of page 1

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

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

{[ snackBarMessage ]}