contestada

Disk scheduling algorithms in operating systems consider only seek distances, because Select one: a. modern disks do not disclose the physical location of logical blocks. b. the operating systems may have other constraints such as writes may be more urgent than reads. c. rotational latency is insignificant compared to the average seek time. d. it is difficult to optimize seek time in disk hardware.

Respuesta :

Answer:

a. modern disks do not disclose the physical location of logical blocks.

Explanation:

In modern disks, the disk scheduling algorithms are built in the disk drive. It is difficult for operating system to schedule for improved rotational latency. All scheduling algorithms are forced to behave the same because operating system may have constraints. Disks are usually accessed in physical blocks. Modern disks put more electronic controls on the disk.

A disk  scheduling is done by the operating system and is made fir the rescheduling the input and output of the disk. Several algorithms  includes FCFS, SSTF, SCAN scheduling, C-SCAN , LOOK  , C-LOOK.

  • Multiple input and output requests can be used for arriving at different processes and only one request can be served at a time.
  • Hard drives are the slowest parts of the system. The modern disks don't disclose location of any logical blocks.

Hence the option A is correct.

Learn ore about the algorithms in operating systems consider only.

brainly.in/question/9248259

Otras preguntas