The Gateway to Computer Science Excellence
0 votes
21 views

Write a program that can be used to compare the effectiveness of adding a tag field to $TLB$ entries when control is toggled between two programs. The tag field is used to effectively label each entry with the process id. Note that a nontagged $TLB$ can be simulated by requiring that all $TLB$ entries have the same tag at any one time. The inputs will be:

  • The number of $TLB$ entries available
  • The clock interrupt interval expressed as number of memory references
  •  A file containing a sequence of (process, page references) entries
  • The cost to update one $TLB$ entry
  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 $TLB$ updates per $1000$ references. 
in Operating System by Veteran (59.3k points) | 21 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,737 questions
57,385 answers
198,559 comments
105,383 users