Consider the following disc Queue with requests for I/O to block on cylinders: 45, 81, 185, 33, 175, 99, 150, 77 (Consider that the head starts from location 58)
What shall be the 2nd request being processed by C-LOOK (Right) disc Scheduling technique for the already given request queue ?
The correct answer is
81
C-LOOK Disk Scheduling Explained
This solution explains the C-LOOK (Circular LOOK) disk scheduling algorithm, specifically the 'Right' direction, for a given set of I/O requests and an initial head position.
Understanding C-LOOK (Right)
C-LOOK is an efficient disk scheduling algorithm. It's similar to SCAN but operates circularly. Here's how C-LOOK (Right) works:
The disk head starts at a specific cylinder (58 in this case).
It moves in one direction (Right, towards higher cylinder numbers) servicing all requests in that direction until it reaches the last request in the queue.
Instead of potentially continuing to the end of the disk and coming back, C-LOOK immediately reverses direction and jumps to the first request in the opposite direction (the lowest numbered request).
It then services requests in this new direction until all requests are completed.
Direction: The algorithm moves Right (towards higher cylinder numbers).
Finding First Request: The requests located at cylinders greater than 58 are {77, 81, 99, 150, 175, 185}. The first request encountered moving right is 77. The head moves from 58 to 77.
Movement: 58 to 77
Request Processed: 77
Finding Second Request: Continuing in the Right direction, the next closest request is 81. The head moves from 77 to 81.
Movement: 77 to 81
Request Processed: 81
This is the 2nd request processed.
Continuing Right Sweep: The head continues servicing requests in ascending order towards the highest cylinder number:
Movement: 81 to 99 (Request Processed: 99)
Movement: 99 to 150 (Request Processed: 150)
Movement: 150 to 175 (Request Processed: 175)
Movement: 175 to 185 (Request Processed: 185)
The head has now reached the highest request number (185) in this direction.
Circular Jump: As per C-LOOK, the head immediately reverses direction and jumps to the lowest request number in the entire queue, which is 33.
Movement: 185 (jump) to 33
Request Processed: 33
Left Sweep: The head now moves in the Left direction, servicing the remaining requests (those smaller than 185 that weren't serviced) in ascending order (from the lowest):
Movement: 33 to 45 (Request Processed: 45)
All requests are now completed.
Processing Sequence Summary
The complete sequence of serviced requests using C-LOOK (Right) is:
Step
Movement
Request Processed
1
58 to 77
77
2
77 to 81
81
3
81 to 99
99
4
99 to 150
150
5
150 to 175
175
6
175 to 185
185
7
185 (jump) to 33
33
8
33 to 45
45
Conclusion on 2nd Request
Based on the step-by-step execution of the C-LOOK (Right) algorithm for the given request queue and starting head position, the first request serviced is 77, and the second request processed is 81.
Was this answer helpful?
Important Questions from Disk Scheduling
Which of the following is the time taken to move an access arm to a certain track on a disk?