FCFS Disk Scheduling Algorithms
Last Updated :
28 Dec, 2022
Prerequisite: 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:
- 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.
- Let us one by one take the tracks in default order and calculate the absolute distance of the track from the head.
- Increment the total seek count with this distance.
- Currently serviced track position now becomes the new head position.
- 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.
C++
#include <bits/stdc++.h>
using namespace std;
int size = 8;
void FCFS(int arr[], int head)
{
int seek_count = 0;
int distance, cur_track;
for (int i = 0; i < size; i++) {
cur_track = arr[i];
distance = abs(cur_track - head);
seek_count += distance;
head = cur_track;
}
cout << "Total number of seek operations = "
<< seek_count << endl;
cout << "Seek Sequence is" << endl;
for (int i = 0; i < size; i++) {
cout << arr[i] << endl;
}
}
int main()
{
int arr[size] = { 176, 79, 34, 60, 92, 11, 41, 114 };
int head = 50;
FCFS(arr, head);
return 0;
}
|
C
#include <stdio.h>
#include <math.h>
int size = 8;
void FCFS(int arr[],int head)
{
int seek_count = 0;
int cur_track, distance;
for(int i=0;i<size;i++)
{
cur_track = arr[i];
distance = fabs(head - cur_track);
seek_count += distance;
head = cur_track;
}
printf("Total number of seek operations: %d\n",seek_count);
printf("Seek Sequence is\n");
for (int i = 0; i < size; i++) {
printf("%d\n",arr[i]);
}
}
int main()
{
int arr[8] = { 176, 79, 34, 60, 92, 11, 41, 114 };
int head = 50;
FCFS(arr,head);
return 0;
}
|
Java
class GFG
{
static int size = 8;
static void FCFS(int arr[], int head)
{
int seek_count = 0;
int distance, cur_track;
for (int i = 0; i < size; i++)
{
cur_track = arr[i];
distance = Math.abs(cur_track - head);
seek_count += distance;
head = cur_track;
}
System.out.println("Total number of " +
"seek operations = " +
seek_count);
System.out.println("Seek Sequence is");
for (int i = 0; i < size; i++)
{
System.out.println(arr[i]);
}
}
public static void main(String[] args)
{
int arr[] = { 176, 79, 34, 60,
92, 11, 41, 114 };
int head = 50;
FCFS(arr, head);
}
}
|
Python3
size = 8;
def FCFS(arr, head):
seek_count = 0;
distance, cur_track = 0, 0;
for i in range(size):
cur_track = arr[i];
distance = abs(cur_track - head);
seek_count += distance;
head = cur_track;
print("Total number of seek operations = ",
seek_count);
print("Seek Sequence is");
for i in range(size):
print(arr[i]);
if __name__ == '__main__':
arr = [ 176, 79, 34, 60,
92, 11, 41, 114 ];
head = 50;
FCFS(arr, head);
|
C#
using System;
class GFG
{
static int size = 8;
static void FCFS(int []arr, int head)
{
int seek_count = 0;
int distance, cur_track;
for (int i = 0; i < size; i++)
{
cur_track = arr[i];
distance = Math.Abs(cur_track - head);
seek_count += distance;
head = cur_track;
}
Console.WriteLine("Total number of " +
"seek operations = " +
seek_count);
Console.WriteLine("Seek Sequence is");
for (int i = 0; i < size; i++)
{
Console.WriteLine(arr[i]);
}
}
public static void Main(String[] args)
{
int []arr = { 176, 79, 34, 60,
92, 11, 41, 114 };
int head = 50;
FCFS(arr, head);
}
}
|
Javascript
<script>
var size = 8;
function FCFS(arr, head)
{
var seek_count = 0;
var distance, cur_track;
for(var i = 0; i < size; i++)
{
cur_track = arr[i];
distance = Math.abs(cur_track - head);
seek_count += distance;
head = cur_track;
}
document.write("Total number of " +
"seek operations = " +
seek_count);
document.write("<br>Seek Sequence is");
for(var i = 0; i < size; i++)
{
document.write("<br>" + arr[i]);
}
}
var arr = [ 176, 79, 34, 60,
92, 11, 41, 114 ];
var head = 50;
FCFS(arr, head);
</script>
|
Output:
Total number of seek operations = 510
Seek Sequence is
176
79
34
60
92
11
41
114
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...