CLOOK Disk Scheduling Algorithm Program in C/C++


Disk scheduling
is done by operating systems to schedule I/O requests arriving for the disk and the algorithm used for the disk scheduling is called Disk Scheduling Algorithm.

In this post, we will discuss the CLOOK Disk Scheduling Algorithm and also write a program for CLOOK disk scheduling algorithm. In CLOOK, the disk arm in spite of going to the end goes only to the last request to be serviced in front of the head and then from there goes to the other end’s last request. Thus, it also prevents the extra delay which occurred due to unnecessary traversal to the end of the disk.

We will use C++ to write this algorithm due to the standard template library support. Hence, we will write the program of CLOOK Disk Scheduling Algorithm in C++, although, it’s very similar to C.

INPUT:
The first line is the size of the disk (m).
The second line is the number of I/O requests (n).
The third line is an array of I/O requests (a[n]).
The fourth line is the head position (h).

OUTPUT:
Print the total head movement.

The following is the CLOOK disk scheduling program in C++.

#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,j,k,n,m,sum=0,x,y,h;
	cout<<"Enter the size of disk\n";
	cin>>m;
	cout<<"Enter number of requests\n";
	cin>>n;
	cout<<"Enter the requests\n";
	vector <int> a(n),l;
	for(i=0;i<n;i++){
		cin>>a[i];
	}
	for(i=0;i<n;i++){
		if(a[i]>m){
			cout<<"Error, Unknown position\n";
			return 0;
		}
	}
	cout<<"Enter the head position\n";
	cin>>h;

	a.push_back(h);
	sort(a.begin(),a.end());

	for(i=0;i<a.size();i++){
		if(h==a[i])
			break;
	}
	k=i;
	if(k<n/2){
		for(i=k;i<a.size();i++){
			l.push_back(a[i]);
		}
		for(i=0;i<k;i++){
			l.push_back(a[i]);
		}
	}
	else{
		for(i=k;i>=0;i--){
			l.push_back(a[i]);
		}
		for(i=a.size()-1;i>k;i--){
			l.push_back(a[i]);
		}
	}
	int temp=l[0];
	cout<<temp;
	for(i=1;i<l.size();i++){
		cout<<" -> "<<l[i]<<' ';
		sum+=abs(l[i]-temp);
		temp=a[i];
	}
	cout<<'\n';
	cout<<"Total head movements = "<< sum<<'\n';

	return 0;
}

OUTPUT:

Enter the size of disk
199
Enter number of requests
8
Enter the requests
98 183 37 122 14 124 65 67
Enter the head position
53
53 -> 65  -> 67  -> 98  -> 122  -> 124  -> 183  -> 14  -> 37 
Total head movements = 481

Let us know in comments if you are having any question regarding this CLOOK Disk Scheduling Algorithm.

And if you found this post helpful, then please help us by sharing this post with your friends. Thank You

Jazib
Hey guys, I have created this platform to share my knowledge with others and to keep you guys updated about the latest technologies.
Leave a Reply