Define swapping, Operating System

Define swapping.

A process requires being in memory to be executed. Though a process can be swapped temporarily out of memory to a backing store and then brought back into memory for continued execution. This process is known as swapping.

 

Posted Date: 6/6/2013 6:16:24 AM | Location : United States







Related Discussions:- Define swapping, Assignment Help, Ask Question on Define swapping, Get Answer, Expert's Help, Define swapping Discussions

Write discussion on Define swapping
Your posts are moderated
Related Questions
Producer-Consumer Problem Using Semaphores The Solution to producer-consumer problem use three semaphores namely- full, empty and mutex. The semaphore 'full' is utilized for

Explain the OS/2 Operating System Like NetWare, OS/2 manage resources at three levels, as shown in Figure 4.5 Resources may be maintained at the session, process, and thread le

Explain the Spawnlp Functions Used in the NetWare Spawnlp(flags, execName, arg0,...)  The Spawnlp function is used to load  a NetWare executable file (NLM) specified by exec

Q. How Program execute in operating system? Program execution: Operating system loads a program in memory and executes the program. The program should be able to end its exec

Write a short note on Memory management. Memory management includes reallocating and allocating the memory space. The kinds of allocation of memory FIXED PARTITIONING

Q. Is there any way to execute truly stable storage? Describe your answer. Answer: Truly steady storage would never lose data. The fundamental technique for steady storage is

What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type

What is independent process? A process is independent it cannot influence or be affected by the other processes implementing in the system. Any process does not share data with

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.