The Gateway to Computer Science Excellence
0 votes
3 views

Consider the following C program:
 

int X[N];
int step = M; /* M is some predefined constant */
for (int i = 0; i < N; i += step) X[i] = X[i] + 1;
  1. If this program is run on a machine with a $4-KB$ page size and $64$-entry $TLB,$ what values of $M$ and $N$ will cause a $TLB$ miss for every execution of the inner loop?
  2. Would your answer in part $(a)$ be different if the loop were repeated many times? Explain.
in Operating System by Veteran (58.8k points) | 3 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,291 answers
198,209 comments
104,888 users