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

How several bits are there in the logical address, Q. Regard as a logical a...

Q. Regard as a logical address space of eight pages of 1024 words every mapped onto a physical memory of 32 frames. a. How several bits are there in the logical address? b. H

Determine the reasons for poor response time, Determine the reasons for Poo...

Determine the reasons for Poor response time Process busy or High I/O rates or High paging rates

Can you give me assistance on my operating system assignment, Can you give ...

Can you give me assistance on my operating system assignment?

Explain about interprocess communication, Explain about interprocess commun...

Explain about interprocess communication The cooperating processes communicate with each other via an interprocess communication facility. IPC gives a mechanism to permit proce

#title:cs604, Consider a scenario of post mailbox, there are two processes ...

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

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

Explain linked list allocation using index, Linked list allocation using in...

Linked list allocation using index The blocks don't have a fixed size. Pointers are utilized to point to the next block in a file. The pointers are set aside as a separate tabl

What is file allocation?, What is File Allocation? The structure that ...

What is File Allocation? The structure that offers the FAT file system its name is the file allocation table . In order to know what this important table does, you should fir

Split the hexadecimal format, The following is a dump of a TCP header in h...

The following is a dump of a TCP header in hexadecimal format: 00CD0018 00000EF1 00000D5D 502200D1 01BF0010 We need to first split the above hex as such 00 CD 00 18 00 00

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