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

Ask an Expert

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

Write your message here..

Related Questions

Explain file structure, File structure Certain files must conform to a ... File structure Certain files must conform to a needed structure that is understood by the operating system. The operating system may consist that an executable file has a parti

What are the major differences between operating systems, Q. What are the m... Q. What are the major differences between operating systems for mainframe computers and personal computers? Answer: In general operating systems for batch systems have simpler

Differences among user-level threads and kernel-level thread, What are two ... What are two differences among user-level threads and kernel-level threads? Under what circumstances is one type better than the other? (1) User-level threads are unknown by th

Define swapping, Define swapping. A process requires being in memory to... Define swapping. A process requires being in memory to be executed. Though a process can be swapped temporarily out of memory to a backing store and then brought back into memo

Explain lru enhanced second chance algorithm, Enhanced Second chance algori... Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

Aggregate planning, Prepare a report that motivates alternatives reactive s... Prepare a report that motivates alternatives reactive strategies that can be used by wind Mud clothing factory

Analysis of Pseudocode Sempahore Solution, Gopher Gallery consists of a sho... Gopher Gallery consists of a shopping mall and a cart ride that covers the 150 acre habitat. There are m visitors and n single-person vehicles. Visitors stroll around the mall at

Explain lru second chance algorithm, Second chance Algorithm When the p... Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c

Android, Which android version is available till now Which android version is available till now

Explain the proper distribution of functionality and code, Explain the Prop... Explain the Proper Distribution of Functionality and Code It is important to note that the bandwidth of the server operating system and server processor availability is fixed.