C-LOOK scheduling is a variation of C-SCAN that reduces disk head movement. Instead of moving the head all the way to the outer edge of the disk after each request, it reverses direction immediately after reaching the last request in that direction. This treats the cylinders as a circular list that wraps from the last cylinder to the first. The document provides an example of the head movement under C-LOOK scheduling for a sample request queue. C-LOOK scheduling results in less head movement than traditional C-SCAN.
1. C-LOOK Scheduling
• SCAN and C-SCAN algorithms move the disk arm
across the full width of the disk
• In practice neither of the algorithm is implemented
this way
http://raj-os.blogspot.in/ 1
2. C-LOOK Scheduling
• In C-LOOK Scheduling the arm goes only as far as
final request in each direction
• Then it reverses direction immediately without going
all the way to the end of the disk
http://raj-os.blogspot.in/ 2
3. C-LOOK Scheduling
• When the head reaches the other end,
– It immediately returns to the beginning of the disk
– Without servicing any requests on the return trip
• Treats the cylinders as a circular list that wraps
around from the last cylinder to the first one
http://raj-os.blogspot.in/ 3
4. C-LOOK Scheduling
• It is a version of C-SCAN
• Arm only goes as far as the last request in each
direction
– then reverses direction immediately, without first going all
the way to the end of the disk
http://raj-os.blogspot.in/ 4
5. C-LOOK Scheduling
• Consider for example an ordered disk queue with
requests involving
– Tracks 98, 183, 37, 122, 14, 124, 65, 67
– Head pointer 53
• The request queue (0-199)
http://raj-os.blogspot.in/ 5
6. C-LOOK Scheduling
• If the disk head is initially at cylinder 53,
– it will first move from 53 to 65, (towards right)
– then to 67, 98, 122, 124, 183, 14 and 37 as shown
in the next slides
http://raj-os.blogspot.in/ 6