Explain c-scan ,look and c-look disk scheduling algorithm, Operating System

Assignment Help:

LOOK

o Like SCAN except stops moving inwards (or outwards) when no more requests in that direction exist.


C-SCAN (circular scan)

o Moves inwards servicing requests until it arrive at the innermost cylinder then jumps to the outside cylinder of the disk without servicing any requests.

o Replicate this over and over.

o Variant service needs from inside to outside and then skip back to the innermost cylinder.


C-LOOK

o Moves inwards servicing needs until there are no more requests in that direction and then it jumps to the outermost outstanding requests.

o Replicate this over and over.

o Variant service requirements from inside to outside after that skip back to the innermost request.


Related Discussions:- Explain c-scan ,look and c-look disk scheduling algorithm

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

Banker''s algorithm, Consider the following snapshot of a system, answer th...

Consider the following snapshot of a system, answer the following questions using the banker's algorithm: 1. What is the content of the matrix Need? Is the system in a safe stat

Explain the threadswitch function used in the netware, Explain the ThreadSw...

Explain the ThreadSwitch function used in the netware Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly reli

System protection, what is the need-to-know principle? why is it important ...

what is the need-to-know principle? why is it important for a protection system to adhere to this principle?

Define tii stands for, TII stands for The abbreviation of TII is Table o...

TII stands for The abbreviation of TII is Table of incomplete instructions.

Page-table lookups, How exactly is a page table used to look up an address?...

How exactly is a page table used to look up an address? The CPU has a page table base register (PTBR)which points to the base (entry 0) of the level-0 page table. Each process h

What is a resource-allocation graph, What is a resource-allocation graph? ...

What is a resource-allocation graph? Deadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph. This graph having of a se

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