Disk Scheduling Algorithms in Operating Systems Consider Only Seek Distances

Disk scheduling algorithms in operating systems consider only seek distances, because

A) rotational latency is insignificant compared to the average seek time.
B) modern disks do not disclose the physical location of logical blocks.
C) the operating systems may have other constraints such as writes may be more urgent than reads.
D) it is difficult to optimize seek time in disk hardware.

Correct Answer:

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Access For Free