What the different paging techniques, Operating System

Assignment Help:

The different paging techniques are

1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be as well large to accommodate in the main memory. One simple solution with this problem is to divide the page table into smaller pieces.

2. Hashed page table method: A general method for handling address spaces larger than 32 bits is to use a hashed page table with the hash value being the virtual page number. Every entry in the hash table contains a linked list of elements that hash to the same location.

3. Inverted page table method: An inverted page table has one entry for every real page of memory. Every entry consists of the virtual address of the page stored in threat real memory location, along with information about the process that owns that page.

4. Shared pages method: Shared page tables are typically implemented as multiple virtual addresses that are mapped to one physical address.

5. Demand paging method: This is alike to a paging system with swapping. Processes inhabit on the secondary memory. When we would like to execute a process, we swap it in to the memory.

 


Related Discussions:- What the different paging techniques

Operating system services, explain about oprating system services and topic...

explain about oprating system services and topics briefly

Explain a computing environment, Q. Polling for an I/O completion is able ...

Q. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the

Explain gui based operating system, GUI - Short for Graphical User Interfa...

GUI - Short for Graphical User Interface a GUI Operating System contains icons and graphics and is commonly navigated by using a computer mouse. Below are some instances of GUI Op

How can the deadlock be prevented-bankers algorithm, How can the deadlock b...

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

Define the tlsfree(tlsindex) function, Define the TlsFree(TLSIndex) Functio...

Define the TlsFree(TLSIndex) Function This function should be called to free a TLSindex allocated by TlsAlloc. It would be executed when there are no more threads in a process

Explain single level directory structure, Single level directory: This ...

Single level directory: This is the easiest directory structure. All the files are controlled in the same directory, which is simple to support and understand. Few of the li

Why do organisations need a structure, Problem 1: (a) The grouping of o...

Problem 1: (a) The grouping of organisational activities (usually into ‘departments' or larger ‘divisions') can be done in different ways. Outline 7 criteria which can be used

What are kernels and what do kernels do, What are kernels and what do kerne...

What are kernels and what do kernels do? The kernel is a program that comprises the central core of a computer operating   system. It has entire control over everything that

Os, why we say" OS is a resource allocator" and “OS is a control program"?

why we say" OS is a resource allocator" and “OS is a control program"?

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