Replacement of Page in O/S

The number of frames allocated to a process can also dynamically change depending on whether you have used global replacement or local replacement for replacing page in case of page fault.

1. Local replacement :-

when a process needs a page which is not in the memory, it can bring in the new page and allocate it a frame from its own set of allocated frames only.

Advantage :-

The pages in the memory for a particular process and the page fault ratio nis affacted by the paging behaviour of only that process.

Disadvantage :-

In local replacement the number of frames allocated to a process does not change so a low priority process may hender a high priority process by not making available to the high priority process its frames.

2. Global replacement :-

When a process needs a page which is not in the memory, it can bring in the new frame and allocate it a frame from the set of all frames, even if that frame is currently allocated to some other processes. i.e one process can take a frame from other.

Advantage :-

Does not hinder the performance of process and hence results in greater system throughput.

Disadvantage :-

The page fault ratio of a process can not be sololy controlled by the process itself. The page in the memory for a process depends on the paging behaviour of other processes as well.

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.

Comments

Process & Its state And process control block :-

⇰ PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution. A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads. The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...

Process Scheduling And Types of Process Schedular :-

⇰ PROCESS SCHEDULING Process Scheduling is a task of Operating System that schedules processes of different states like new, ready, waiting, terminated and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time. ⏩ Followings are some objectives of Process Scheduling :- i > To increase the amount of users within acceptable response times. ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and give reference to the processes holding the key resources. ⇰ PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and allows multiple users to shar...

Definition of Stack and its algorithm with working process(data structure)

Stack A Stack is an ordered collection of items where the addition of items and the removal of existing items always takes place at the same end. This end is commonly referred to as the “top". * working method of stack :- i> Initially top=-1 ii> By increasing top pointer we can insert element in the stack. iii> when top=size of stack-1 then stack is full. iv> By decreasing the top pointer we can remove the element from stack. v> when top=-1 then the stack is empty. figure shows run time stack * The fundamental operations which are possible on a stack are:- 1. push operation (insertion). 2. pop operation (deletion). 3. peep opetation(extract informat...

Search This Blog