C-LOOK Disk Scheduling (Circular LOOK)
C-LOOK Disk Scheduling (Circular LOOK)
🔷 What is C-LOOK?
C-LOOK is an improved version of C-SCAN.
👉 Key idea:
-
Head moves in one direction only
-
Services requests only up to the last request
-
Then jumps to the first request (not to disk end)
1. How C-LOOK Works
🔷 Steps
-
Start at current head position
-
Move in one direction (e.g., increasing cylinders)
-
Service all requests in that direction
-
Stop at the last request (not end of disk)
-
Jump to the lowest request
-
Continue in the same direction
2. Example
🔹 Given:
-
Request queue:
-
Initial head position:
-
Direction:
👉 Moving toward higher cylinders
🔷 Step-by-Step Execution
Step 1: Move Forward (≥ 53)
Requests:
Service in order:
Step 2: Jump to Lowest Request
Remaining:
Jump:
Step 3: Continue Forward
🔷 Final Order of Service
3. Total Head Movement
👉 Total = 322 cylinders
4. Advantages
1. Uniform Waiting Time
-
Similar to C-SCAN
-
Fair distribution of service
2. Less Unnecessary Movement
-
Does not go to disk ends
-
Better than C-SCAN
3. Predictable Behavior
-
Always moves in one direction
5. Disadvantages
1. Jump Cost
-
Large jump from last → first request
2. Slightly Higher Movement than LOOK
-
Due to circular jump
6. Key Insight
👉 Differences:
-
SCAN → goes to disk end
-
LOOK → stops at last request
-
C-SCAN → circular, goes to disk end
-
C-LOOK → circular, stops at last request
7. Comparison Snapshot
| Algorithm | Movement Style | Efficiency |
|---|---|---|
| SCAN | Back & forth to ends | Good |
| LOOK | Back & forth to last request | Better |
| C-SCAN | One direction to ends | Uniform |
| C-LOOK | One direction to last request | Efficient + uniform |
8. Simple Analogy
-
C-SCAN → Elevator goes to top floor, then returns to ground floor without stopping
-
C-LOOK → Elevator goes only to highest requested floor, then jumps to lowest request
9. Key Takeaways
-
C-LOOK = optimized C-SCAN
-
Avoids unnecessary travel to disk ends
-
Provides uniform waiting time
-
Widely used in modern systems
Comments
Post a Comment