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

Conservative garbage collection, Conservative GC can be used for languages ...

Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll

Determine a policy that is not valid page replacement policy, Determine a p...

Determine a policy that is not a valid page replacement policy? RU policy (Recurrently used) is not a valid page replacement policy.

Define busy waiting and spinlock, Define busy waiting and spinlock. Whe...

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c

Describe the benefits of using microkernels, Question: (a) (i) What is ...

Question: (a) (i) What is a microkernel? Describe the benefits of using microkernels. (ii) How does a microkernel-based operating system differ from a traditional operating

Comparing gc to malloc, Garbage collectors trade space for time. If we coll...

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

Explain processing predefined application protocols, Explain Processing Pre...

Explain Processing Predefined Application Protocols Implementing and swift processing of predefined application protocols is sure to improve performance of server - side applic

Name the evolutionary process models, Normal 0 false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain independent process and a cooperating process, Question: a) Ea...

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

Explain chaining to handle collision, Explain Chaining to Handle Collision ...

Explain Chaining to Handle Collision Chaining: One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision

Explain the application interaction protocols, Explain the Application Inte...

Explain the Application Interaction Protocols Application interaction protocols are uniquely defined for each program and are used to logically describe the data being passed b

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages