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

Paging, what is the use of valid invalid bits in paging

what is the use of valid invalid bits in paging

MULTITASKING, EXPLAIN MULTITASKING IN DETAIL

EXPLAIN MULTITASKING IN DETAIL

Major advantage of the layered approach to system design, Q. What is the ma...

Q. What is the major advantage of the layered approach to system design? What are the de-merits of using the layered approach? Answer: As in all cases of modular design as well

What are the different constituents of a process, Problem: a) Define th...

Problem: a) Define the term ‘process' and what are the different constituents of a process. b) In the three-state process model, what does each of the three states signify?

Write a short note about schedulers, Write a short note about schedulers. ...

Write a short note about schedulers. Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purpose

Compression regarding the file system in windows 2000, Write short note on ...

Write short note on compression regarding the file system in Windows 2000. NTFS is able to perform data compression on individual files or on all data files in a directory. To

Kernel, 1. What must a kernel provide for an effective user-level thread im...

1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of the

Explain lru second chance algorithm, Second chance Algorithm When the p...

Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c

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