Compare Proposal

Nothing to compare.

Virtual Memory Manager Paging

  • Posted at : 24 days ago
  • Post Similar Project
2000

Budget
3
Proposals
81
Views
Awarded
Status
Skills Required

Posted By -

MC

5.0
Projects Posted : 8
Projects Paid : 5
Services Purchased : 0
Total Spent :
106
Feedbacks : 80 %

Project Details show (+) hide (-)

You will design and implement in this assignment a virtual memory manager with paging, and then
simulate its operation for each of the following page replacement algorithms: RANDOM (replace a
random page), FIFO (first-in-first-out), LRU (least recently used), LRU-X (replace the page whose
K-th most recent access is furthest in the past; for example, LRU-1 is simply LRU while LRU-2
replaces pages according to the time of their penultimate access; LRU-K improves significantly on
LRU with regard to locality in time), LFU (least frequently used), LDF (longest distance first -
replace the page which is on longest distance from the current page), OPT-lookhead-X (optimum
with lookahead of X future addresses), and WS (Working Set). There will be 8 sets of output from
these 8 runs.