Comparison of disk scheduling algorithms, Operating System

Assignment Help:

COMPARISON OF DISK SCHEDULING ALGORITHMS

Name      Description                  Remarks     (Selection according to requestor)

 

RSS        Random scheduling     for analysis and simulation

FIFO      First in first out            Fairest of them all

PRI         Priority by process     Control outside of disk queue   management

LIFO      Last in first out            Maximize locality and resource utilization

 

            (Selection according to requested item)

 

SSTF                 Shortest seek time first             High utilization, small queues

SCAN                Back and forth over disk            Better service distribution

C-SCAN            One way with fast return           Lower service variability

N-step-SCAN    Multiple queues                          Scan N records at a time        

                                                                           Service guarantee

FSCAN              SCAN using 2 queues                 load sensitive

 

 


Related Discussions:- Comparison of disk scheduling algorithms

Can a direct access file be read sequentially, Can a direct access file be ...

Can a direct access file be read sequentially? Explain. Yes. Keep a counter, cp, initially set to 0. After reading record cp, increment cp.

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Define how to manage the interaction of client and server, Managing the int...

Managing the interaction of client and server  Among the differences between traditional application programs and client server ones is that developers must create a mechanism

Assignment, i need the job to be done within 3 days

i need the job to be done within 3 days

Paging, Paging full question

Paging full question

Different levels of a multilevel queuing system, Q. What merit is there in ...

Q. What merit is there in having different time-quantum sizes on different levels of a multilevel queuing system? Answer: Processes that require more frequent servicing for ins

Minor page fault , Minor page fault :I f the page is loaded in memory at t...

Minor page fault :I f the page is loaded in memory at the time the fault is started, but is not checked in the memory management unit as being loaded in memory, then it is named a

Difference between preemptive and nonpreemptive scheduling, Define the diff...

Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul

Buffer, What is bounded buffer

What is bounded buffer

Difference between the vfork() and fork() system call, In the mean while th...

In the mean while the fork() system call the Kernel creates a copy of the parent process's address space and adds it to the child process. But the vfork() system call do no

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