Explain disk scheduling algorithms-shortest seek time first, Operating System

Assignment Help:

SSTF (Shortest Seek Time First)

After a demand go to the closest request in the work queue regardless of direction
Decrease total seek time compared to FCFS
Disadvantages
Starvation is probable stay in one area of the disk if very busy
Switching directions deliberates things down

Related Discussions:- Explain disk scheduling algorithms-shortest seek time first

Operation management, #question After working for 30 years, Ramjee Somjee D...

#question After working for 30 years, Ramjee Somjee Dutt opted for VRS and started a courier company and did very well in the first four years. He was now looking for expansion of

Explain two level directory, Two Level Directory This kind of structure...

Two Level Directory This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users. In this kind of s

Define ageing, Define Ageing Ageing is a method of enhancing the priori...

Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation

Determine what a locality of reference entails, Locality of reference entai...

Locality of reference entails that the page reference being made by a process Locality of reference entails that the page reference being made by a process is similarly to be

Explain process scheduling in time sharing, Explain process scheduling in t...

Explain process scheduling in time sharing The relevant features of time sharing are: 1. Process priorities do not depend on the nature of the processes 2. Proc

Androids latest os, what is the latest OS of ANDROID in US

what is the latest OS of ANDROID in US

Error detection, about error detection in operating system and how does it ...

about error detection in operating system and how does it take place?

What are the benefits of multiprogramming?, What are the benefits of multip...

What are the benefits of multiprogramming? Responsiveness : Multithreading is an interactive application may permit a program to continue running even if part of it is block

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Unix , A friend has promised to log in at a particular time. However, he ne...

A friend has promised to log in at a particular time. However, he needs to be contacted as soon as he logs in. The shell script checks after every minute whether he has logged in o

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages