Scribd
Upload
362 views2 pages

FCFS Disk Scheduling Algorithms

The document discusses the First Come First Serve (FCFS) disk scheduling algorithm. FCFS services requests in the order they arrive without starvation. It calculates the total number of seek operations by taking the absolute distance between the disk head position and each requested track in the request queue sequentially. The example shows an input request sequence, initial head position, the seek sequence output, and calculation of the total seek count as 510.

Uploaded by

Monalisa Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
362 views2 pages

FCFS Disk Scheduling Algorithms

The document discusses the First Come First Serve (FCFS) disk scheduling algorithm. FCFS services requests in the order they arrive without starvation. It calculates the total number of seek operations by taking the absolute distance between the disk head position and each requested track in the request queue sequentially. The example shows an input request sequence, initial head position, the seek sequence output, and calculation of the total seek count as 510.

Uploaded by

Monalisa Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

FCFS Disk Scheduling Algorithms

Given an array of disk track numbers and initial head position, our task is to find the total
number of seek operations done to access all the requested tracks if First Come First Serve
(FCFS) disk scheduling algorithm is used.
First Come First Serve (FCFS)
FCFS is the simplest disk scheduling algorithm. As the name suggests, this algorithm entertains
requests in the order they arrive in the disk queue. The algorithm looks very fair and there is no
starvation (all requests are serviced sequentially) but generally, it does not provide the fastest
service.
Algorithm:
1. Let Request array represents an array storing indexes of tracks that have been
requested in ascending order of their time of arrival. ‘head’ is the position of disk head.
2. Let us one by one take the tracks in default order and calculate the absolute distance of
the track from the head.
3. Increment the total seek count with this distance.
4. Currently serviced track position now becomes the new head position.
5. Go to step 2 until all tracks in request array have not been serviced.
Example:
Input:
Request sequence = {176, 79, 34, 60, 92, 11, 41, 114}
Initial head position = 50

Output:
Total number of seek operations = 510
Seek Sequence is
176
79
34
60
92
11
41
114
The following chart shows the sequence in which requested tracks are serviced using FCFS.

Therefore, the total seek count is calculated as:


= (176-50)+(176-79)+(79-34)+(60-34)+(92-60)+(92-11)+(41-11)+(114-41)
= 510
Implementation:
Implementation of FCFS is given below. Note that distance is used to store absolute distance
between head and current track position.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy