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

Describe paging algorithm needs a reference bit, Q. Suppose that you want ...

Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide

Making the transition to client - server programming, Making the Transition...

Making the Transition to Client - Server Programming Making the transition to client - server programming is a significant effort. Client - server applications must be designed

Operating systems structures, with the aid of diagrams describe the followi...

with the aid of diagrams describe the following OS structure monolithic,layered and client server.

Medium term scheduler, Medium term scheduling is form of the swapping ope...

Medium term scheduling is form of the swapping operation. This attaches to processes that are in a suspended or blocked state. They are swapped out of real-memory storage until t

Race condition, list the prevention of mechanism for race condition with op...

list the prevention of mechanism for race condition with operating system

#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

Nachos file system, File System Interface and Implementation The Nachos ...

File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

Explain long term scheduling, Long term scheduling Scheduling explicitl...

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont

Describe the state when you run an unlink operation, Describe when you run ...

Describe when you run an unlink() operation to remove a file on the ext3 file system. Be specific about what disk blocks have to be written where in what order. State your assumpti

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