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

Could you replicate a multilevel directory structure, Q. Could you replica...

Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Producer - consumer synchronization, This assignment is based on Programmin...

This assignment is based on Programming Project 6.40 in Silbershatz. Implement the ProducerXConsumer program according to the instructions for Project 6.40 for both Linux and Win32

Multiprogramming, how response times are reduced by allowing time sharing o...

how response times are reduced by allowing time sharing on top of multiprogramming

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Write a short note on disk scheduling, Write a short note on disk schedulin...

Write a short note on disk scheduling One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the

Write a note on deadlocks, Write a note on deadlocks. The proper defini...

Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

Virtual memory, How a virtual memory can be implemented? What are the benef...

How a virtual memory can be implemented? What are the benefits of using virtual memory?

Define race condition, Define race condition. When various process acce...

Define race condition. When various process access and manipulate similar data concurrently, then the outcome of the execution depends on certain order in which the access take

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages