What is total head movement for FCFS scheduling for given I/O blocks 98, 183, 37, 122, 14, 124, 65, 67, where head is initially at cylinder 53 -
What is total head movement for FCFS scheduling for given I/O blocks 98, 183, 37, 122, 14, 124, 65, 67, where head is initially at cylinder 53 -
The correct option is D 640
The total head movement for FCFS
scheduling for given I/O blocks 98, 183, 37, 122, 14, 124, 65, 67, where head
is initially at cylinder 53 is 640.
If the disk head is initially at cylinder 53, it will first move
from 53 to 98, then to 183, 37, 122, 14, 124/65, and finally
to 67, for a total head movement of 640 cylinders.
First come, first served (FCFS) is an operating system
process scheduling algorithm
and a network routing management mechanism that automatically executes queued
requests and processes by the order of their arrival.
First come, first served (FCFS), is the
simplest scheduling algorithm. FIFO simply queues processes in the order that
they arrive in the ready queue.
The total head movement for FCFS scheduling for given I/O blocks 98, 183, 37, 122, 14, 124, 65, 67, where head is initially at cylinder 53 is 640.
If the disk head is initially at cylinder 53, it will first move from 53 to 98, then to 183, 37, 122, 14, 124/65, and finally to 67, for a total head movement of 640 cylinders.
First come, first served (FCFS) is an operating system process scheduling algorithm and a network routing management mechanism that automatically executes queued requests and processes by the order of their arrival.
First come, first served (FCFS), is the simplest scheduling algorithm. FIFO simply queues processes in the order that they arrive in the ready queue.
