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 lru approximation page replacement in detail, LRU approximation pag... LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp

Most-recently used algorithm, Evicting the most-recently used (MRU) page do... Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

Any four types of operating system feature and structure, explain any four... explain any four types of operating system feature and structure(design)

Algorithm for reconstructing a logical ring, Q. Present an algorithm for re... Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

Benefits of dynamic linkage of libraries, Q. What are three benefits of dyn... Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The

Is the internet a lan or else a wan, Q. Is the Internet a LAN or else a WAN... Q. Is the Internet a LAN or else a WAN? Answer: The Internet is a WAN as the a variety of computers are located at geographically different places and are connected by long-dis

Explain variable partitioning in memory management, VARIABLE PARTITIONING ... VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process.   50k 40k

How virtual memory is implemented, How Virtual memory is implemented Vi... How Virtual memory is implemented Virtual memory can be implemented along with Segmentation and Paging

Batch oriented and interactive operating system., properies of Batch orient... properies of Batch oriented and interactive operating system.

Define implementation of segmentation with an example, IMPLEMENTATION OF SE... IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of