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
Q. Explain the differences in terms of cost between the three storage types nonvolatile, volatile and stable. Answer: Volatile storage refers to main as well as cache memory an

Give an overview of WINDOWS 2000 file management. Windows makes use of the NTFS and File Allocation Table file systems. The Older versions of the FAT file system had file name

Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

What is turnaround time? Turnaround time is the interval from the time of submission to the time of completion of a process. It is the sum of the periods exhausted waiting to g

What are the advantages of Indexed allocation? The benefits are a. No external-fragmentation problem b. Solves the size-declaration problems. c. Supports direct access

Recognition of essential syntactic constructs by reductions, this task is carried out by Recognition of essential syntactic constructs by reductions, this task is carried out

What is starvation? A main problem related to deadlock is starvation. Starvation is the circumstances where process waits indefinitely within the semaphore. Indefinite blocking

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

How exactly is a page table used to look up an address? The CPU has a page table base register (PTBR)which points to the base (entry 0) of the level-0 page table. Each process h