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.
Q. What is the purpose of system calls? Answer: System calls permit user-level processes to request services of the operating system.
Explain the ScheduleWorkToDo Function used in Netware ScheduleWorkToDo(MyThread Function, arg, workToDo) The ScheduleWorkToDo ( ) function is specific to NetWare 4.0. This c
Multiprocessing - An Operating System proficient of utilizing and supporting more than one computer processor. Below are some instances of multiprocessing Operating Systems. Li
COMPARISON OF DISK SCHEDULING ALGORITHMS Name Description Remarks (Selection according to requestor) RSS Random scheduling fo
Explain internal fragmentation The Internal fragmentation signifies to the result of reserving a piece of space without ever intending to use it. This space is wasted that this
Q. You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr
When programming with threads, there are three very common mistakes that programmers often make: 1. locking twice (depending on the system and type of lock, can cause crashes, h
what is meant by lazzy swapper
Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne
Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use
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