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

Palm os provides no signifies of concurrent processing, Q. Palm OS provides...

Q. Palm OS provides no signifies of concurrent processing. Discuss three major complications that concurrent processing adds to an operating system. Answer: a. A meth

Write about critical regions and monitors, Write about critical regions and...

Write about critical regions and monitors. Critical region definition Monitor definition Implementation of the conditional-region construct Syntax of monitor Monito

Assignment on Fork System Call, Parent process P creates three child proces...

Parent process P creates three child processes, C1, C2, and C3. Each child process executes a memory and CPU intensive application of your choice. Your choice should be such that

Semantics for execution of rpcs, Q. Presume that a distributed system is su...

Q. Presume that a distributed system is susceptible to server failure. What mechanisms would be needed to guarantee the exactly once semantics for execution of RPCs? Ans

Define latency plus seek time, Define Latency plus seek time The total...

Define Latency plus seek time The total time to arrange a disk drive mechanism for a block of data to be read from is its Latency plus seeks time

What are the differences between process and thread, What are the differenc...

What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and

Define the division of labour between client and server, Define the Divisio...

Define the Division of Labour between Client and Server Given our definition of client - server as the interaction between dispersed application logic components it must be not

Describe the purpose of the open and close operations, Q. Describe the pur...

Q. Describe the purpose of the open() and close() operations. Answer: The open() operation notifies the system that the named file is about to become active. The c

Load sharing , Load Sharing : Processes are not given to a particular proc...

Load Sharing : Processes are not given to a particular processor. A global queue of threads is used to maintain. Each processor, when idle, picks a thread from this queue. Note th

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