In shortest service time first policy, applied on disk scheduling, the disk request is selected

Related MCQs

• In disk scheduling, the shortest service time first policy selects the disk request that
• 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.
• 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 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.
• 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
• 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
• In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction
• In round robin (time slicing) policy applied on uni-processor scheduling
• In round robin (time slicing) policy applied on uni processor scheduling
• In last- in-first- out, disk scheduling policy