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
Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-

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

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont

What are the different types of semaphore? Principally the semaphore is able to be classified into two on the basis of their values a)      Counting semaphore: In counting s

The following information is available for three MPS (Master Product Scheduling) items: Product A                            An 80 unit order is to be started in Week 3.

Define what an assembler is An assembler is machine dependant.

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv

What is Single-level Directory All files are constrained in the similar directory, which is simple to support and understood. One limitation is when the number of files enhance

Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy