Describe swapping technique in unix systems, Operating System

Assignment Help:

Describe swapping technique in UNIX systems.

Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swapped out until sufficient memory is available. Allocation of both main memory as well as swap space is done first fit. When the size of a process main memory image increases, a new piece of memory large enough for the whole image is allocated. The memory image is copied and the old memory is freed and the appropriate tables are updated. If no single piece of memory is large sufficient the process is swapped out such as it will be swapped back in with the new size.

Decisions as regards which process to swap in or out are made by the process scheduler, as well called as the swapper. The scheduler wakes up at least every 4 seconds to check for processes to be swapped in or out. There are confirm to avoid thrashing, fundamentally by not letting a process to be swapped out, previous to it has been in the memory for a certain amount of time.

If jobs require not be swapped out, the process table is searched to find a process deserving to be brought in. If there isn't enough memory available processes are swapped out until there.

 


Related Discussions:- Describe swapping technique in unix systems

Write a script in linux to match a data directory, Write a script that uses...

Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd

Microsoft, Discuss the high barriers to entry in the market for PL operatin...

Discuss the high barriers to entry in the market for PL operating systems

Explain about error detection method, Q. Explain about Error detection meth...

Q. Explain about Error detection method? Error detection: error can occur in CPU, in I/O devices or in memory hardware. Operating system constantly needs to be aware of possi

What is the sequence in which resources may be utilized, What is the sequen...

What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re

Demand-paging system, Consider a demand-paging system with the following ti...

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv

Nachos file system, File System Interface and Implementation The Nachos ...

File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

List the four steps that are essential to run a program, List the four step...

List the four steps that are essential to run a program on a completely dedicated machine. a. Reserve machine time. b. Manually load program into memory. c. Load starting

Define thrashing, Define thrashing. Thrashing is the accident of high p...

Define thrashing. Thrashing is the accident of high page traffic and low CPU utilization. It is observed that the cause of thrashing is an under-commitment of memory to program

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd