The Gateway to Computer Science Excellence
0 votes
23 views

Write a program that simulates a toy paging system that uses the $\text{WSClock}$ algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process termination and creation are ignored (eternal life). The inputs will be:

  • The reclamation age threshhold
  • The clock interrupt interval expressed as number of memory references
  • A file containing the sequence of page references
  1. Describe the basic data structures and algorithms in your implementation.
  2. Show that your simulation behaves as expected for a simple (but nontrivial) input example.
  3. Plot the number of page faults and working set size per $1000$ memory references.
  4. Explain what is needed to extend the program to handle a page reference stream that also includes writes. 
in Operating System by Veteran (54.8k points) | 23 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,508 answers
195,529 comments
100,966 users