Explain hashed page table method, Operating System

Assignment Help:

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.

 


Related Discussions:- Explain hashed page table method

Write a program to demonstrate the memory leak problem, Write a program (wi...

Write a program (with the programming language and on the platform of your choice) to demonstrate the memory leak problem (see http://en.wikipedia.org/wiki/Memory_leak for detail

What are turnaround time and response time, What are turnaround time and re...

What are turnaround time and response time? Turnaround time is the interval among the submission of a job and its completion. Response time is the interval among submission

System protection, what is the need-to-know principle? why is it important ...

what is the need-to-know principle? why is it important for a protection system to adhere to this principle?

Explain rehashing to handle collision, Explain Rehashing to Handle Collisio...

Explain Rehashing to Handle Collision Rehashing:  Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we

What is the design issues involved in segmentation?, SEGMENTATION HARDWARE ...

SEGMENTATION HARDWARE An execution to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Ev

Unix, UNIX Shell and History feature. 1.Creating a child process. 2.Creatin...

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd