A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a

Related MCQs

• A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on
• Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.
• In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
• A-Fixed-Head disk, B-Movable-Head disk, 1- One head per track and al head are mounted on rigid arm that extends across all tracks. 2- Only one head and head is mounted on the arm, such that it can position the track.
• In disk scheduling, the shortest service time first policy selects the disk request that
• In shortest service time first policy, applied on disk scheduling, the disk request is selected
• RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.
• In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
• In disk scheduling, SCAN algorithm states
• The access time in disk scheduling is