What is the translation look aside buffer (tlb), Operating System

Translation Look aside Buffer

In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has those page-table entries that have been most currently used. Usually, every virtual memory instance gives 2 physical memory accesses-- one to get appropriate page-table entry, and one to get the defined data. Using TLB in-between, this is reduced to single physical memory access in forms of TLB-hit.

 

1982_Translation Look aside Buffer (TLB).png

Posted Date: 8/20/2012 3:31:43 AM | Location : United States







Related Discussions:- What is the translation look aside buffer (tlb), Assignment Help, Ask Question on What is the translation look aside buffer (tlb), Get Answer, Expert's Help, What is the translation look aside buffer (tlb) Discussions

Write discussion on What is the translation look aside buffer (tlb)
Your posts are moderated
Related Questions
Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy

What is the use of fork and exec system calls? Fork is a system call by which a latest process is created. Exec is also a system call, which is used after a fork by one of the

Write short note on recovery regarding the file system in Windows 2000. In many file systems a power breakdown at the wrong time can damage the file system data structures so s

Q. Which of the subsequent programming techniques and structures are good for a demand-paged environment? Which aren't good? Describe your answers. a. Stack b. Hashed symbol

Explain the Statements Present in Assembly Language An assembly program consists of subsequent three types of statements: a. Imperative statements: this point out an action

Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the

FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute


Transparency : Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed to lo

SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv