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

Ask an Expert

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

Write your message here..

Related Questions

Define properties of distributed operating system, Define properties of Dis... Define properties of Distributed operating system Distributed:- This system distributes computation among several physical processors. The processors do not share memory or a

What disadvantages are there to this two-level directory, What disadvantage... What disadvantages are there to this two-level directory? Without other provisions, two users who require cooperating with each other are hampered in reaching every other's fi

Difference among pre-emptive and non pre-emptive scheduling, Q. Define the ... Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta

Memory pages, Applications allocate memory in terms of the number of bytes ... Applications allocate memory in terms of the number of bytes that they need, but this level of granularity is too ?ne-grained for the operating system to manage the system memory i

Is disk scheduling except fcfs scheduling, Q. Is disk scheduling except FC... Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.

How can an index file be used to speed up, How can an index file be used to... How can an index file be used to speed up the access in direct-access files? Have an index in memory; the index gives the key and the disk location of its corresponding record.

Explain objectives of the file management system, Problem: a) Define a ... Problem: a) Define a ‘file' and list the objectives of the file management system. b) List the ways in which programs access files and determine for what file types you woul

Define race condition, Define race condition. When various process acce... Define race condition. When various process access and manipulate similar data concurrently, then the outcome of the execution depends on certain order in which the access take

Describes responsibilities of the I/O manager, Q. Describes responsibilitie... Q. Describes responsibilities of the I/O manager? Answer: The I/O manager is responsible for file systems and device drivers and network drivers. The I/O manager keeps follow

Explain general graph directory structure, General Graph Directory A s... General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc