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 the different sections of a process., Explain the different section... Explain the different sections of a process.     Entry section     Critical section     Exit section     Remainder section Consider a system inclusive of n processe

Explain concept of synchronization, Synchronization In communication am... Synchronization In communication among processes messages passed may be blocking or nonblocking - also called as synchronous and asynchronous. Blocking send : The sending pr

Define where a program generation activity aims, Define where a Program gen... Define where a Program generation activity aims  Program generation activity aims at Automatic generation of program

..unbounded buffer, what is unbounded buffer what is unbounded buffer

Explain important fuction of virtual file system, Virtual File System serve... Virtual File System serves two important functions. 1. It divides file-system-generic operations from their execution by defining a clean VFS interface. 2. The VFS is based

Permanently starves cpu-bound programs, Q. Presume that a scheduling algori... Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori

Unix, UNIX Shell and History feature. 1.Creating a child process. 2.Creatin... UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

Process abstraction in operating systems, Many early operating systems rega... Many early operating systems regarded processes as different timesharing users. The process abstraction is a popular way to organize concurrent programs, but it is not the only cho

Difference between internal and external fragmentation, Explain the differe... Explain the difference between internal and external fragmentation. Internal Fragmentation is the area in a region or a page that is not used by the job occupying that region o

Describe the main architectural layers of windows xp, Q. Describe the three... Q. Describe the three main architectural layers of Windows XP? Answer: (1) The HAL (Hardware Abstraction Layer) creates operating system portability by hiding hardware differ