Hashed page table, Operating System

Hashed page tables

A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elements that hash to the similar location.

Each element consist of three fields

a) The virtual page number

b) The value of the mapped page frame

c) A pointer to the next element in the linked list.  


Posted Date: 6/6/2013 6:57:37 AM | Location : United States

Related Discussions:- Hashed page table, Assignment Help, Ask Question on Hashed page table, Get Answer, Expert's Help, Hashed page table Discussions

Write discussion on Hashed page table
Your posts are moderated
Related Questions
What is co-operating scheduling? CPU scheduling decisions may possibly place under the following four circumstances: 1.      When process switches from the running state to


Logical File System Responsible for providing the before discussed interface to the user including: File access. Directory operations. Security and protection.

How is it different from the unbounded buffer algorithm ? Explain.

Interrupts The hardware mechanism that enables a device to inform the CPU is called an interrupt. The basic interrupt mechanism works as follows. The CPU hardware has a wire kn

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

Q.  To build a vigorous distributed system you must know what kinds of failures can occur. a. List three possible kinds of failure in a distributed system. b. State which of

Question 1 Explain single Partition Allocation and Multiple Partition Question 2 What is PCB? What useful information is available in PCB? Question 3 Explain Preemptive and No

We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to