What is paging? name the different paging techniques, Operating System

What is paging? Name the different paging techniques.

Paging is a memory management method that permits the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fitting the varying-sized memory chunks onto the backing store, from which the majority of the previous memory-management schemes suffered. The fragmentation problem undergo in the backing store is as well avoided. For the reason benefit over the previous methods, paging in its different forms is commonly used in most operating systems.

The various paging techniques are.

1.         Multilevel paging or hierarchical paging method.

2.         Hashed page table method.

3.         inverted page table method

4.         shared pages method

5.         Demand paging method.

 

Posted Date: 6/24/2013 8:28:49 AM | Location : United States







Related Discussions:- What is paging? name the different paging techniques, Assignment Help, Ask Question on What is paging? name the different paging techniques, Get Answer, Expert's Help, What is paging? name the different paging techniques Discussions

Write discussion on What is paging? name the different paging techniques
Your posts are moderated
Related Questions
How Virtual memory is implemented Virtual memory can be implemented along with Segmentation and Paging

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

What is critical section problem? Consider a system consists of 'n' processes. Every process has segment of code called a critical section, in which the process might be changi

Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w


What criteria are important in choosing a file organisation?

The scheduling technique in which CPU is allocated to the process with least CPU-burst time is known as  Shortest job first Scheduling is a scheduling technique in which CPU i


Q. Consider a calculating environment where a process is given the privilege of accessing object only n times. Suggest a scheme for implementing this policy. Answer: Add an i

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