SlideShare a Scribd company logo
3
Most read
5
Most read
15
Most read
C-SCAN Scheduling

• C-SCAN Scheduling is a variant of SCAN
  Scheduling
• It is designed to provide uniform wait time

• Like SCAN, C-SCAN moves the head from one end
  of the disk to other end, servicing requests along the
  way


                       http://raj-os.blogspot.in/          1
C-SCAN 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/        2
C-SCAN 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/   3
C-SCAN 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,199, 0, 14 and 37 as shown in
     the next slides




                         http://raj-os.blogspot.in/            4
C-SCAN Scheduling




  Initial head position
      http://raj-os.blogspot.in/   5
C-SCAN Scheduling




Head movement from 53 to 65

        http://raj-os.blogspot.in/   6
C-SCAN Scheduling




Head movement from 65th to 67

         http://raj-os.blogspot.in/   7
C-SCAN Scheduling




Head movement from 67 to 98

       http://raj-os.blogspot.in/   8
C-SCAN Scheduling




Head movement from 98 to 122

       http://raj-os.blogspot.in/   9
C-SCAN Scheduling




Head movement from 122 to 124

        http://raj-os.blogspot.in/   10
C-SCAN Scheduling




Head movement from 124 to 183

         http://raj-os.blogspot.in/   11
C-SCAN Scheduling




Head moved to the extreme track

         http://raj-os.blogspot.in/   12
C-SCAN Scheduling




Head is moved from one extreme end to the other

               http://raj-os.blogspot.in/         13
C-SCAN Scheduling




Head is moving from 0 to 14th track

           http://raj-os.blogspot.in/   14
C-SCAN Scheduling




Head is moved from 14th to 37th track

            http://raj-os.blogspot.in/   15
C-SCAN Scheduling

• Advantages

  – Better than SCAN Scheduling in terms of waiting
    time
  – i.e., provides uniform waiting time

• Disadvantages

  – It is not optimal

                        http://raj-os.blogspot.in/    16

More Related Content

PPT
Scan scheduling 50 1
PPTX
Data transfer and manipulation
PPT
Disk scheduling
PPTX
Advanced computer architecture
PPT
31 address binding, dynamic loading
PPT
Code generator
PDF
Code generation in Compiler Design
PPT
Compiler Design Unit 5
Scan scheduling 50 1
Data transfer and manipulation
Disk scheduling
Advanced computer architecture
31 address binding, dynamic loading
Code generator
Code generation in Compiler Design
Compiler Design Unit 5

What's hot (20)

PPTX
Disk Scheduling Algorithm in Operating System
PPT
Graph coloring problem
PPTX
PDF
Tutorial: Cross-compiling Linux Kernels on x86_64
PDF
Design and analysis of algorithms
PDF
Memory management
PPTX
Computer Organization
PPTX
Structure of the page table
PDF
loaders and linkers
PDF
Cache coherence
PDF
Instruction Level Parallelism (ILP) Limitations
PPTX
Associative memory and set associative memory mapping
PPTX
daa-unit-3-greedy method
PDF
File System Implementation - Part1
PPTX
CS304PC:Computer Organization and Architecture Session 28 Direct memory acces...
PPTX
Frame buffer
PDF
Resume Preparation - Workshop
PPTX
B. SC CSIT Computer Graphics Unit 1.3 By Tekendra Nath Yogi
PPTX
Operating system 34 contiguous allocation
PPT
FIle Management.ppt
Disk Scheduling Algorithm in Operating System
Graph coloring problem
Tutorial: Cross-compiling Linux Kernels on x86_64
Design and analysis of algorithms
Memory management
Computer Organization
Structure of the page table
loaders and linkers
Cache coherence
Instruction Level Parallelism (ILP) Limitations
Associative memory and set associative memory mapping
daa-unit-3-greedy method
File System Implementation - Part1
CS304PC:Computer Organization and Architecture Session 28 Direct memory acces...
Frame buffer
Resume Preparation - Workshop
B. SC CSIT Computer Graphics Unit 1.3 By Tekendra Nath Yogi
Operating system 34 contiguous allocation
FIle Management.ppt
Ad

Viewers also liked (20)

PPT
Look scheduling.51
PPT
C look scheduling 51 1
PPT
Sstf scheduling.50
PPT
Fcfs scheduling
PPTX
First-Come-First-Serve (FCFS)
PPT
Disk scheduling.49
PPT
Index allocation 48 1
PPT
Disk scheduling algorithm.52
PPT
CPU Scheduling Algorithms
PPT
Present Continuous
PPTX
Web sockets in Java
PDF
Java sockets
PDF
Open and online: connections, community and reality
PDF
Garbage Collection without Paging
PPTX
Copenhagen Open For Connections Dias
PPTX
Multithreaded programming
PPTX
Insert a Page Number in the Running Head
PPTX
Presentiaon task sheduling first come first serve FCFS
PPS
The Look Of Love
PPTX
4 character encoding-ascii
Look scheduling.51
C look scheduling 51 1
Sstf scheduling.50
Fcfs scheduling
First-Come-First-Serve (FCFS)
Disk scheduling.49
Index allocation 48 1
Disk scheduling algorithm.52
CPU Scheduling Algorithms
Present Continuous
Web sockets in Java
Java sockets
Open and online: connections, community and reality
Garbage Collection without Paging
Copenhagen Open For Connections Dias
Multithreaded programming
Insert a Page Number in the Running Head
Presentiaon task sheduling first come first serve FCFS
The Look Of Love
4 character encoding-ascii
Ad

Similar to C scan scheduling 50 2 (7)

PPTX
Disk Scheduling.pptx
PPT
Disk scheduling
PPTX
Device Management
PPTX
secondary storage structure :disk arm scheduling in OS
PDF
cam and follower Design of Mechanical Systems.pdf
PPT
Explained Disk Scheduling Algo ...
PDF
NoSQL Database Migration Masterclass - Session 3: Migration Logistics
Disk Scheduling.pptx
Disk scheduling
Device Management
secondary storage structure :disk arm scheduling in OS
cam and follower Design of Mechanical Systems.pdf
Explained Disk Scheduling Algo ...
NoSQL Database Migration Masterclass - Session 3: Migration Logistics

More from myrajendra (20)

PPT
Fundamentals
PPT
Data type
PPTX
Hibernate example1
PPTX
Jdbc workflow
PPTX
2 jdbc drivers
PPTX
3 jdbc api
PPTX
4 jdbc step1
PPTX
Dao example
PPTX
Sessionex1
PPTX
Internal
PPTX
3. elements
PPTX
2. attributes
PPTX
1 introduction to html
PPTX
Headings
PPTX
Forms
PPT
PPTX
Views
PPTX
Views
PPTX
Views
PPT
Starting jdbc
Fundamentals
Data type
Hibernate example1
Jdbc workflow
2 jdbc drivers
3 jdbc api
4 jdbc step1
Dao example
Sessionex1
Internal
3. elements
2. attributes
1 introduction to html
Headings
Forms
Views
Views
Views
Starting jdbc

C scan scheduling 50 2

  • 1. C-SCAN Scheduling • C-SCAN Scheduling is a variant of SCAN Scheduling • It is designed to provide uniform wait time • Like SCAN, C-SCAN moves the head from one end of the disk to other end, servicing requests along the way http://raj-os.blogspot.in/ 1
  • 2. C-SCAN 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/ 2
  • 3. C-SCAN 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/ 3
  • 4. C-SCAN 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,199, 0, 14 and 37 as shown in the next slides http://raj-os.blogspot.in/ 4
  • 5. C-SCAN Scheduling Initial head position http://raj-os.blogspot.in/ 5
  • 6. C-SCAN Scheduling Head movement from 53 to 65 http://raj-os.blogspot.in/ 6
  • 7. C-SCAN Scheduling Head movement from 65th to 67 http://raj-os.blogspot.in/ 7
  • 8. C-SCAN Scheduling Head movement from 67 to 98 http://raj-os.blogspot.in/ 8
  • 9. C-SCAN Scheduling Head movement from 98 to 122 http://raj-os.blogspot.in/ 9
  • 10. C-SCAN Scheduling Head movement from 122 to 124 http://raj-os.blogspot.in/ 10
  • 11. C-SCAN Scheduling Head movement from 124 to 183 http://raj-os.blogspot.in/ 11
  • 12. C-SCAN Scheduling Head moved to the extreme track http://raj-os.blogspot.in/ 12
  • 13. C-SCAN Scheduling Head is moved from one extreme end to the other http://raj-os.blogspot.in/ 13
  • 14. C-SCAN Scheduling Head is moving from 0 to 14th track http://raj-os.blogspot.in/ 14
  • 15. C-SCAN Scheduling Head is moved from 14th to 37th track http://raj-os.blogspot.in/ 15
  • 16. C-SCAN Scheduling • Advantages – Better than SCAN Scheduling in terms of waiting time – i.e., provides uniform waiting time • Disadvantages – It is not optimal http://raj-os.blogspot.in/ 16