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.
Define Name of some language processors? Name of some language processors are as follow: Assembler, Compiler and Interpreter
What are the methods for handling deadlocks ? The technique for handling the deadlocks are: We are able to use protocol to prevent or avoid the deadlock, make sure tha
What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The
Question 1 Explain the structure of operating system in detail Question 2 Explain the following scheduling algorithm 1) First come Firs
General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc
Explain DosCreateThread Functions Used in the OS/2 DosCreateThread(&threadID,MyThreadFunction,arg,flags,stackSize) DosCreateThread creates a thread within the context of th
Concept of Reentrancy It is a useful, memory-saving method for multiprogrammed timesharing machines. A Reentrant method is one in which multiple clients can share a singl
how to differentiate scheduling algorithms?
Q. Illustrate the function of Loader? A loader is a routine which loads an object program and prepares it for execution. There are many loading schemes: relocating, absolute an
mail me
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