What are the requirements for a swapper to work, Operating System

 

The swapper works on the biggest scheduling priority. Initially it will look for any sleeping process, if not get then it will see for the ready-to-run process for swapping. But the major need for the swapper to work the ready-to-run process must be core-resident for at least 2 seconds before going out. And for swapping in the process must have been resided in the swap machine for at least 2 seconds. If the need is not satisfied then the swapper will go into the wait state on that event and it is activated once in a second by the Kernel.

 

Posted Date: 7/30/2012 1:03:13 AM | Location : United States







Related Discussions:- What are the requirements for a swapper to work, Assignment Help, Ask Question on What are the requirements for a swapper to work, Get Answer, Expert's Help, What are the requirements for a swapper to work Discussions

Write discussion on What are the requirements for a swapper to work
Your posts are moderated
Related Questions
Define the “Throughput” of a system  Throughput is Number of programs processed by it per unit time

Explain process scheduling in time sharing The relevant features of time sharing are: 1.      Process priorities do not depend on the nature of the processes 2.      Proc

What is a Real-time system? A Real-time system is used when inflexible time requirements have placed on the operation of processor or the flow of data so it is often used as a

? FREE ASSOCIATION ASSIGNMENTS of multiprograming

Define the Communications Techniques - Application interaction protocols    Communications techniques are well defined. They give developer the programmatic mechanism to transf

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Question: a) The following questions refers to Windows XP networking: i) Briefly, explain how a host joins a network using DHCP? ii) Which IP address could be assigned to a

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

There is a process bloacked by a semaphore and no other process in the ready queue, can the blocked process get back to the ready queue without the semsignal() function?

please help us to write a code in c for tree directory structures.