Write a short note on disk scheduling, Operating System

Assignment Help:

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:

  • Whether this operation is input or output
  • What the disk address for the transfer is
  • What the memory address for the transfer is
  • What the number of bytes to be transferred is

                 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.

 


Related Discussions:- Write a short note on disk scheduling

Define caching, Define caching. A cache is a region of fast memory that...

Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are

Explain the basic concepts of segmentation, Explain the basic concepts of s...

Explain the basic concepts of segmentation. Segmentation definition User view of program Hardware used with diagram-segment table, base, limit & offset Protection and

Determine utilization of cpu and the paging disk, Q. Consider the demand-p...

Q. Consider the demand-paged computer system where the level of multiprogramming is currently fixed at four. The system was recently deliberate to determine utilization of CPU and

Major page fault, Major page fault: If the page is not loaded in memory a...

Major page fault: If the page is not loaded in memory at the time the fault is stated, then it is named major or hard page fault. The handler in the machine requires to search a

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Thread, advantages and disadvantages of kernal level thread

advantages and disadvantages of kernal level thread

What is the main problem with the fcfs scheme, Question : a) Consider ...

Question : a) Consider table 1.0 below, assume the processes arrived in the order P 1 , P 2 , P 3 , P 4 at time shown and need the indicated burst time (both in milliseconds)

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd