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!
Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algorithm favour I/O-bound programs and yet not permanently starves CPU-bound programs?
Answer: It will favour the I/O-bound programs for the reason that of the relatively short CPU burst request by them however the CPU-bound programs will not starve for the reason that the I/O-bound programs will relinquish the CPU relatively often to do their I/O.
Compare user threads and kernel threads. User threads:- User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation
example of first fit best fit and worst fit
Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes?
With software algorithms for mutual exclusion, such as Dekker's algorithm, Peterson's algorithm, or Lamport's bakery algorithm, note that optimizing compilers and out-of-order exec
How can an index file be used to speed up the access in direct-access files? Have an index in memory; the index gives the key and the disk location of its corresponding record.
What is sector sparing? Low-level formatting also sets aside extra sectors not visible to the operating system. The controller can be told to change each bad sector logically w
how to solve queing theory step by step
Explain the various file types A common technique for executing file types is to contain the type as part of the file name. The name is split into two parts - a name and an ext
Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu
What is a binary Semaphore?
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