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

Explain structure, Explain Structure The Grammar for programming langua...

Explain Structure The Grammar for programming language is a formal description of Structure

Parent process: why not finishing and how to make finish, #include #inclu...

#include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

List out the advantages of windows 2000 file management, List out the advan...

List out the advantages of windows 2000 file management. Permits detailed security for individual folders and files. Built-in granular compression capabilities

What are the disadvantages of linked allocation, What are the disadvantages...

What are the disadvantages of linked allocation? The drawbacks are a. Used only for sequential access of files. b. Direct access is not supported c. Memory space neede

Cpu scheduling alogarithm program in javascript, a program that can do cpu ...

a program that can do cpu scheduling algorithm priority using javascript or php to display gaant chart and calculate waiting and average waiting time

Parent and child process communicate in unix, Parent and Child process comm...

Parent and Child process communicate in unix A child and parent can interact through any of the normal inter-process communication schemes (pipes, message queues, sockets, s

Which are the different states of a process, Which are the different states...

Which are the different states of a process? Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait

Briefly explain about file system implementation, Briefly explain about fil...

Briefly explain about file system implementation? Several on-disk and in-memory structures are used to execute a file system. On disk, the file system may have information abou

What is a thread, What is a thread? A thread or else called a lightweig...

What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s

What are the use of job queue, What are the use of job queues, ready queues...

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages