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

What are the objectives for a file management system, What are the objectiv...

What are the objectives for a file management system? To meet the data management wants and requirements of the user, which embrace storage of data and the ability to

Linux OS, Ask questioDevelop a utility in C language which will run in Linu...

Ask questioDevelop a utility in C language which will run in Linux operating systems to display following properties of the system: ? Processor speed ? Ram size ? Computer name ? S

Palm os provides no signifies of concurrent processing, Q. Palm OS provides...

Q. Palm OS provides no signifies of concurrent processing. Discuss three major complications that concurrent processing adds to an operating system. Answer: a. A meth

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain deadlock, Explain Deadlock Every process in a set of processes ...

Explain Deadlock Every process in a set of processes is waiting for an event which only a process in the set can cause.

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Paging, protection in paging

protection in paging

Explain multithreading operating system, Multithreading - Operating system...

Multithreading - Operating systems that permit different parts of a software program to run concurrently. Operating systems that would come into this category are: Linux UNI

Explain lru second chance algorithm, Second chance Algorithm When the p...

Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c

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