How is a process chosen for being swapped either in or out?, Operating System

How is a process chosen for being swapped either in or out?

Swap out:

a.         If the process is idle.

b.         If process has been in main memory for a long time.

c.         If process is large.

d.        If no obvious candidates are found, a process is picked by age.

Swap in:

o              If a process has been swapped out since a long time.

o              If a process is small.

 

Posted Date: 6/24/2013 8:18:41 AM | Location : United States







Related Discussions:- How is a process chosen for being swapped either in or out?, Assignment Help, Ask Question on How is a process chosen for being swapped either in or out?, Get Answer, Expert's Help, How is a process chosen for being swapped either in or out? Discussions

Write discussion on How is a process chosen for being swapped either in or out?
Your posts are moderated
Related Questions
What is paging? Paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fi


Question: a) What special measures must be taken to ensure the reliability, availability, and security of electronic commerce and digital business process? b) What are the c

What are the five major activities of an operating system in regard to file management? The creation and deletion of files The creation and deletion of directories The s

Develop a user mode command interpreter which support these functions: "list-short" -- just like ls without any options "list-long" -- same as ls -l "change" -- same as cd Your co

What is spooling? Spooling overlaps the I/O of single job with the computation of other jobs.

What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Since I/O devices differ widely in their function

Determine a processing that is not a part of Synthesis phase  Perform LC processing is not a part of Synthesis phase

explain how response time are reduced by allowing time sharing on top of multiprogramming

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are