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!
What is long-term, medium-term, short-term?
In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage device, where they are kept back for later execution. The job scheduler or long term scheduler selects processes from this pool and loads them into memory fro execution.
The CPU scheduler or short term scheduler selects from among the processes that are ready to allocates and execute the CPU to one of them. Long term scheduler executes less often whereas short term scheduler executes very frequently. The major idea behind a medium-term scheduler is that sometimes it can be advantageous to remove processes from memory and thus reduce the degree of multiprogramming. Later the process is able to be reintroduced into memory and its execution can be executed can be continued where it left off. Medium -term scheduler swap out and swap in processes.
1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of th
What are the requirements to be satisfied by the critical section problem? Following are the necessities to be satisfied by the critical section problem: a) Mutual exc
Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-
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
explain hierarchical,hashed and inverted paging
Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples for each resource type.
Ask question #Minimum
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
Q. Suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of LWPs. In addition the system allo
Buffering Messages exchanged by communication processes reside in a impermanent queue. Such a queue can be executed in three ways. Zero capacity: The queue length is 0.
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