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

What are the different accessing methods of a file? The different types of accessing a file are: Sequential access: Information in the file is accessed sequentially

The field that consists of a segment index or an internal index is known as Target datum is field that consists of a segment index or an internal index.

Explain the Request/Response Interface   Many issues are involved in providing a procedural interface for client functions to interact with server components. First off, since

What is process control block? Every process is represented in the OS by a process control block. It has many pieces of information associated with an exact process.

What is spooling? Spooling overlaps the I/O of single job with the computation of other jobs.

Briefly discuss on real-time scheduling? It is divided into two types.  Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. T

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1.      Single level directory 2.      Two level directory

Page Fault Handling conditions like, where the copy on write bit of a page is set and that page is send by more than one process, the Kernel assign new page and copies the conten