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!
Write a short note about schedulers.
Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purposes, processes as of these queues in some fashion. The selection process is hold out by the appropriate Scheduler.
In a batch system habitually more processes are spooled to a mass-storage device where they are kept for later execution. The Job scheduler or Long-term scheduler selects processes from this pool and loads them into memory for implementation. The CPU scheduler or Short-term scheduler selects from among the processes that are ready to execute and allocates the CPU to one of them.
The primary distinction among these two schedulers is the frequency of their implementation. The short-term scheduler should select a new process for the CPU frequently. A process may implement for only a few milliseconds before waiting for an I/O request.
The long-term scheduler alternatively, implement much less frequently. There may possibly be minutes between the creations of new processes in the system. The long-term scheduler manages of the Degree of multiprogramming the number of process in the memory. If the degree of multiprogramming is steady after that the process leaves the system. Therefore the long-term scheduler may require to be invoked only when a process leaves the system. For the reason that the long interval between the executions the long-term scheduler is able to afford to take more time to select a process for execution.
Q. Define Input - Output operations? Serial lines, Disks, tapes and other devices should be communicated with at a very low level. The user require only specify the device and
What is the use of FIFOs in client-server applications
Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers
Question: A set of processes are in a deadlock state when every process in the set is waiting for an event that can be caused by only another process in the set. (a) There
Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every
Clocks in distributed systems : a. Why are clocks difficult to synchronize in distributed systems? b. What features in a system assume that the clocks are (reasonably) synchr
how intranet can make your business effective
Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper
The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer
What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t
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