A

CKNOWLEDGE MENT

:
This term pap er would not b e accomplishe d without the

generouscontri butions of any individuals and organizations. We are very much grateful tothem for their unlimited help and

support.Above all, we express our gratitude to A

LLAH

the almighty, who aided uswith his strength, gave

us wisdom and patience to complete this term paper.Addition ally, we thank our course instructor M
D

.M
AHBUBUL

H
AQUE

, whobelieved that we could t erminate this term paper on time. His moral guid

elines,endless effort, and joyful encouragement made us successful in this paper.Furt hermore, we want to show

our appreciation to the executives, to thelibrarians of UIU library, and to the labassistants of the computer labs, for

their unlimited patience during the time of research writing.Moreov er, we are also thankful to our classmates, group

members, andfriends for their helps and supports. We would like to show our endless gratitudeby

specifying name of F
ARIA

A
HMED

for her support in this term paper.At last, we thank to our parents and

other family members for their helps,supports and sacrifices during the study period
Disk Scheduling: As we know that on a single Computer we can Perform Many Operations at a Time so that Management is also necessary on all the Running Processes those are running on the System at a Time. With the help or Advent of the Multi-programming we can Execute Many Programs at a Time. So fir Controlling and providing the Memory to all the Processes Operating System uses the Concept of Disk Scheduling. In this the Time of CPU is divided into the various Processes and also determines that all the processes will Work Properly. So that Disk Scheduling Will Specifies that at which time which Process will be executed by the CPU. So that the Scheduling means to Execute all the Processes those are given to a CPU at a Time. The

Scheduling is used for Divide the Total Time of the CPU between the Number or Processes So that the Processes can execute Concurrently at a Single Time. For Sharing the Time or For Dividing the Total Time of the CPU, the CPU uses the following the Scheduling Techniques. 1) FCFC or First Come First Serve: In this Jobs or Processes are Executed in the Manner in which they are entered into the Computer. In this Operating System Creates a Queue which contains the Sequence Order in which they are to be Executed and the Sequence in which the CPU will Execute the Process.. In this all the Jobs are performed according to their Sequence Order as they have entered. In this the Job which had Requested first will firstly performed by the CPU. And the Jobs those are entered Later will be Executed in to their Entering Order. 1) SSTF or Shortest Seek Time First :- in this Technique The Operating System will Search for the Shortest time means this will search which job will takes a Less Time of CPU for Running. And After Examining all the jobs, all the Jobs are arranged in the Sequence wise or they are Organized into the Priority Order. The Priority of the Process will be the Total Time which a Process will use For Execution. The Shortest Seek Time Will Include all the Time means Time to Enter and Time to Completion of the Process. Means the Total Time which a Process Will Take For Execution. 4) C-Scan Scheduling: - In the C-Scan all the Processes are Arranged by using Some Circular List. Circular List is that in which there is no start and end point of the list means the End of the List is the Starting Point of the list. In the C-Scan Scheduling the CPU will search for the Process from Start to end and if an End has Found then this again start from the Starting Process. Because Many Times When a CPU is executing the processes then may a user wants to enter some data means a user wants to enter Some data So that at that Situation the CPU will Again Execute that Process after the Input Operation. So that C-Scan Scheduling is used for Processing Same Processes again and Again. 5) Look Scheduling :- In the Look Scheduling the CPU Scans the List from Starting to End of the Disk in which the various Processes are Running and in the Look Scheduling the CPU will Scan the Entire Disk from one End to the Second end. 1) Round Robin. : In the Round Robin Scheduling the Time of CPU is divided into the Equal Numbers which is also called as Quantum Time. Each Process which is Request for Execution will Consumes the Equal Number of Times of the CPU and after the Quantum Time of First Process, the CPU will automatically goes to the Next Process. But the Main Problem is that after the Completion of the Process the Time Will also be Consumed by the Process. Means if a Process either or not have Some Operations To perform the Time of CPU will also be Consume by the CPU , So this is the Wastage of the Time of the CPU. 2) Priority Scheduling : In this Each Process have Some Priorities Assign To them , Means each and Every Process will be Examined by using the Total Time Which will be Consumed by the Process. The Total Time of the Process, and Number of times a Process needs Some Input and Output and Number of Resources will be Examines to set the Priorities of the Processes. So that all the Processes are Arranged into the Form of these Criterias and After that they will be Processed by the CPU. 3) Multilevel Queue: The Multilevel Queue is used when there are multiple queues for the various different processes as we know that there are many different types of

Works those are to be performed on the Computers at a Time. So that for organizing the various or different Types of Queues the CPU Maintains the Queues by using this Technique. In this all the queues are Collected and Organized in the Form of Some Functions which they are requesting to perform. So that the various Types of Queues are maintained which contains all the Processes which have Same Type.

Examples of Disk Scheduling Algorithms

Work Queue: 23, 89, 132, 42, 187 there are 200 cylinders numbered from 0 - 199 the diskhead stars at number 100

1. FCFS total time is estimated by total arm motion

2. SSTF

3. SCAN o assume we are going inwards (i.e., towards 0)

4. LOOK

reduce variance compared to SCAN

5. C-SCAN

6. C-LOOK

DISK SCHEDULING ALGORITHMS

A hard disk drive is a collection of plates called platters. The surface of each platter is divided into circular tracks. Further more, each track is divided into smaller pieces called sectors. Disk I/O is done sector by sector. A group of tracks that are positioned on top of each other form a cylinder. There is a head connected to an arm for each surface, which handles all I/O operations. For each I/O request, first head is selected. It is then moved over the destination track. The disk is then rotated to position the desired sector under the head= and finally, the read/write operation is performed. There are two objectives for any disk scheduling algorithm: 1. Maximize the throughput - the average number of requests satisfied per time unit. 2. Minimize the response time - the average time that a request must wait before it is satisfied. Some of the disk scheduling algorithms are explained below. 1. FCFS 2. SSTF (First Come, First Served)
perform operations in order requested no reordering of work queue no starvation: every request is serviced poor performance

(Shortest Seek Time First)

after a request, go to the closest request in the work queue, regardless of direction reduces total seek time compared to FCFS Disadvantages

3. SCAN go from the outside to the inside servicing requests and then back from the
outside to the inside servicing requests.

starvation is possible; stay in one area of the disk if very busy switching directions slows things down

repeats this over and over. reduces variance compared to SSTF. 4. LOOK like SCAN but stops moving inwards (or outwards) when no more requests in
that direction exist.

5. C-SCAN (circular scan) moves inwards servicing requests until it reaches the innermost cylinder; then
jumps to the outside cylinder of the disk without servicing any requests. repeats this over and over. variant: service requests from inside to outside, and then skip back to the innermost cylinder.

6. C-LOOK moves inwards servicing requests until there are no more requests in that
direction, then it jumps to the outermost outstanding requests. repeast this over and over. variant: service requests from inside to outside, then skip back to the innermost request.

http://en.wikipedia.org/wiki/Scheduling_(computing)