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

What is independent process, What is independent process? A process is ...

What is independent process? A process is independent it cannot influence or be affected by the other processes implementing in the system. Any process does not share data with

MICROKERNEL, ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

Differences between foreground and background, Describe the differences bet...

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

Define the conditions of deadlock prevention, What are the four necessary c...

What are the four necessary conditions of deadlock prevention?       Ans:  Four essential conditions for deadlock prevention: a. The meaning of removing the mutual exclusio

Define jobs which are admitted to the system for processing, Define the Job...

Define the Jobs which are admitted to the system for processing is called The Jobs which are admitted to the system for processing is known as long-term scheduling.

Os installation, Question: OS Installation / File system a) Why is NTFS...

Question: OS Installation / File system a) Why is NTFS portioning preferred over FAT16 or FAT32 when security is of primary concern? b) State a situation or an application w

Explain two-phase locking protocol, Q. Show that a few schedules are possib...

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

Example of producer consumer - semaphore, Now let's implement bounded produ...

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

All the explanations of operating system and its types., operating systems ...

operating systems and its types together with its design issues and their examples.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd