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 on disk scheduling
One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the disc it issues a system call to the operating system. The request state severer pieces of information:
If the disk controller and drive are available the request can be serviced immediately. If the controller or drive is busy any new request for service will be placed on the queue of pending request for that drive. For a multiprogramming system with several processes the disk queue may often have several pending requests. Therefore when request is accomplish the operating system chooses which pending request to service next.
A daemon is a process that removes itself from the terminal and disconnected, executes, in the background, waiting for requests and responding to them. It may also be described as
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
advantages and disadvantages of kernal level thread
Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following
Basic File System Uses the specific device driver. Deals with blocks of data that are exchanged with the physical device. Concerned with the placement of blocks on
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.
Determine a component of a process precedence sequence Process name, Sequence operator ‘;’ and Concurrency operator ‘,’
Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU
What are two differences among user-level threads and kernel-level threads? Under what circumstances is one type better than the other? (1) User-level threads are unknown by th
How the Nested Macro calls are expanded LIFO (Last in First out)
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