Tlb replacement algorithm, Operating System

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current free frame list is {2,5,8,1,...}.  The first frame in the free frame list will be used whenever needed. Suppose TLB has two entries. Both TLB and page table are empty initially. FIFO is used as TLB replacement algorithm. Suppose the following logical address is accessed in order: 0x3d,0x30,0xe5,0x7d, 0x33, 0xef. For each of the following address access:

1. specify the physical address that is mapped to it.

2. Suppose it takes 10 ns to access TLB, and 100ns to access memory, and 8ms to handle page fault. How long time it takes to access this address?

Posted Date: 4/2/2013 4:08:49 AM | Location : United States







Related Discussions:- Tlb replacement algorithm, Assignment Help, Ask Question on Tlb replacement algorithm, Get Answer, Expert's Help, Tlb replacement algorithm Discussions

Write discussion on Tlb replacement algorithm
Your posts are moderated
Related Questions
Did Abhinav agree to the initial timeline requested by Rebecca

What is degree of multiprogramming ? Degree of multiprogramming signifies the number of processes in memory. If the degree of Multiprogramming is steady after that the average

Ask question #Minimum 100 words accepteWrite an xeyes command to display a window that is: ? SIZE: ¦ 400 pixels wide ¦ 300 pixels tall ? LOCATION: ¦ 100 pixels from the right edge

Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th

Briefly discuss on real-time scheduling? It is divided into two types.  Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. T

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Consider the following snapshot of a system, answer the following questions using the banker's algorithm: 1. What is the content of the matrix Need? Is the system in a safe stat


How exactly is a page table used to look up an address? The CPU has a page table base register (PTBR)which points to the base (entry 0) of the level-0 page table. Each process h