C-SCAN Disk Scheduling (Circular SCAN)
C-SCAN Disk Scheduling (Circular SCAN)
🔷 What is C-SCAN?
C-SCAN (Circular SCAN) is a variation of the SCAN algorithm designed to provide more uniform waiting time.
👉 Key idea:
-
The disk head moves in one direction only
-
After reaching the end, it jumps back to the beginning
-
No requests are serviced during the return
1. How C-SCAN Works
🔷 Step-by-Step
-
Head starts at current position
-
Moves in one direction (e.g., toward higher cylinders)
-
Services all requests along the way
-
Reaches the end of the disk
-
Immediately jumps back to the start (0)
-
Continues servicing in the same direction
2. Example
🔹 Given:
-
Request queue:
-
Initial head position:
-
Direction:
👉 Moving from 0 → 199
🔷 Step-by-Step Movement
Move Forward (servicing requests ≥ 53):
Jump to Beginning:
Continue Forward:
🔷 Final Order of Service
3. Key Characteristics
1. Uniform Waiting Time
-
All requests are treated more equally
-
Avoids bias toward middle cylinders
2. Single Direction Movement
-
Head moves in only one direction
-
More predictable performance
3. Circular Behavior
-
Disk is treated like a circular queue
-
End connects back to beginning
4. Limitations
1. Extra Movement
-
Head travels from end → beginning without servicing
-
Adds overhead
2. Slightly Less Efficient than SCAN
-
Due to jump movement
5. Key Insight
👉 Unlike SCAN:
-
SCAN → services requests in both directions
-
C-SCAN → services in one direction only
👉 Result:
-
More uniform waiting time
-
Less variance in response time
6. Comparison: SCAN vs C-SCAN
| Feature | SCAN | C-SCAN |
|---|---|---|
| Movement | Back and forth | One direction only |
| Return path | Services requests | No servicing |
| Waiting time | Uneven | More uniform |
| Complexity | Moderate | Moderate |
7. Key Takeaways
-
C-SCAN = Circular version of SCAN
-
Head moves in one direction only
-
Jumps back to start without servicing
-
Provides uniform wait time
-
Slight overhead due to jump

Comments
Post a Comment