Explain hashed page table method, Operating System

Hashed page table method

A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number. Every entry in the hash table contains a linked list of elements that hash to the same location. Every element consists of three fields that are a) the virtual page number b) the value of the mapped page frame and c) a pointer to the next element in the linked list.

The virtual page number inside the virtual address is hashed into the hash table. The virtual page number is evaluate to field (a) in the first element in the linked list. If there is a match then the corresponding page frame (field (b)) is used to form the desired physical address. If there is no match then subsequent entries in the linked list are searched for a matching virtual page number.

 

Posted Date: 6/25/2013 1:04:54 AM | Location : United States







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

Write discussion on Explain hashed page table method
Your posts are moderated
Related Questions
A daemon is a process that removes itself from the terminal and disconnected, executes, in the background, waiting for requests and responding to them. It may also be described as

Define the Programming Fundamentals for Client- Server Developers Coding for client - server enforces good programming fundamentals. In order for applications to become client



What is the resident set and working set of a process? Resident set is that portion of the process image that is actually in real-memory at a certain instant. Working set is th

Question: a) Illustrate with the help of a diagram, the difference between two tier and three tier architectures. b) Explain in what kind of environment, a peer to peer envi

Explain the Exit (status) Function  Exit function causes the calling process to be terminated. Actually, all file descriptors are immediately closed but the process is   not

LOOK o Like SCAN except stops moving inwards (or outwards) when no more requests in that direction exist. C-SCAN (circular scan) o Moves inwards servicing requests u

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit