Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
What are Tree-structured directories We can generalize the directory structure to a tree of arbitrary height. This permits the user to create their own sub directories and to c
Q. Consider the following page-replacement algorithms. Rank the algorithms on a five-point scale from "bad" to "perfect" according to their page-fault rate. Detach those algorithm
What are the five major activities of an operating system in regard to process management? The creation and deletion of both user and system processes The suspension and res
Determine what the “blocking factor” of a file is Blocking factor is the number of logical records in one physical record
Q. Describe why SSTF scheduling tends to favour middle cylinders over the innermost and outermost cylinders. Answer: The middle of the disk is the location having the smalles
The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to sat
What are the three main purposes of an operating system? _ To give an environment for a computer user to implement programs on computer hardware in a convenient and efficient m
Explain the steps in deadlock recovery. a) Exterminate off all processes involved - drastic. b) Exterminate off one at a time till deadlock gone - select a victim.
Q. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protoc
Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd