Replacement algorithm for tlb, Operating System

Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Initially, TLB is empty. FIFO is used as the replacement algorithm for TLB.

int X[N];

for (int k = 0; k < K; k++)

for (int i = 0; i < N; i += M)

X[i] = random(); //generate some random number

a) If K is 1, what values of M and N will cause a TLB miss for every access of array X. Explain why.

b) If K is a very large number, what values of M and N will cause TLB miss for every access of array X. Explain why.

Posted Date: 4/2/2013 4:07:38 AM | Location : United States







Related Discussions:- Replacement algorithm for tlb, Assignment Help, Ask Question on Replacement algorithm for tlb, Get Answer, Expert's Help, Replacement algorithm for tlb Discussions

Write discussion on Replacement algorithm for tlb
Your posts are moderated
Related Questions

Define the “turn-around” time of a user job Turn- around time is total time taken to execute the job.

Q. What is the use of the command interpreter? Why is it generally separate from the kernel? Answer: It reads commands from the user or else from a file of commands and execu

The swapper work s on the biggest scheduling priority. Initially it will look for any sleeping process, if not get then it will see for the ready-to-run process for swapping. Bu


Relative file organization A relative file is an array of fixed-length slots and the records can be inserted in the first free slot found from the beginning of the file and

Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic

what is a batch system give me answer in simple words so that i can understand

fork and join syntax in java

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c