Rate monotonic scheduling

1. Rate Monotonic Scheduling
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<math.h>
int pnum=0,lcmno,p[2][100],cap[2][100];
int lcm(int a[],int n);
int gcd(int a, int b);
class pro
{
public:
void get()
{
fstream file("Input File.txt",ios::out | ios::in);
int t1;
string temp;
while (!file.eof())
{
file>>temp>>t1>>temp>>p[0][pnum]>>temp>>p[1][pnum];
pnum++;
}
pnum--;
file.close();
int temp1[100];
for(int i=0;i<pnum;i++)
{
temp1[i]=p[1][i];
}
lcmno=lcm(temp1,pnum);
}
void display(void )
{
cout<<"Process:t1t2t3t4t5n";
for(int i=0;i<2;i++)
{
for(int j=0;j<pnum;j++)
{
if(j==0 && i==0)
Page 1

2. Rate Monotonic Scheduling
{
cout<<"CPU TIME:t"<<p[i][j]<<"t";
}
else if(j==0 && i==1)
{
cout<<"Period:tt"<<p[i][j]<<"t";
}
else
{
cout<<p[i][j]<<"t";
}
}
cout<<"n";
}
cout<<"LCM:"<<lcmno<<endl;
}
int check()
{
int i,n=pnum;
float in=((float)1/(float)n);
float u=((n)*(pow(2.0,((float)1/(float)n))-1));
float ut=0;
for(i=0;i<pnum;i++)
{
ut=ut+((float)p[0][i]/(float)p[1][i]);
}
cout<<"Utilization Bond:"<<u;
cout<<"nTotal Utilization Time:"<<ut;
if(u>ut)
return 1;
else
return 0;
}
};
int priority();
void sch();
int lcm(int a[],int n)
{
int ans = a[0];
for (int i = 1; i < n; i++)
{
ans = (((a[i] * ans)) /(gcd(a[i], ans)));
}
Page 2

3. Rate Monotonic Scheduling
return ans;
}
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int priority()
{
int p=-1,lessp=lcmno;
{
for(int i=0;i<pnum;i++)
{
if(cap[0][i]!=0)
{
if(lessp>cap[1][i])
{
p=i;
lessp=cap[1][i];
}
}
}
}
return p;
}
void sch()
{
fstream file("Output File.txt",ios::out );
int t,pr,i;
for(i=0;i<pnum;i++)
{
cap[0][i]=p[0][i];
cap[1][i]=p[1][i];
}
for(t=0;t<lcmno;t++)
{
for(i=0;i<pnum;i++)
{
if(cap[0][i]>cap[1][i])
{
cout<<"System is not scheduablen";
return;
Page 3

4. Rate Monotonic Scheduling
}
}
pr=priority();
if(pr!=-1)
{
file<<t<<"-"<<t+1<<"|Process:"<<pr+1<<endl;
}
else
{
file<<t<<"-"<<t+1<<endl;
}
cap[0][pr]--;
for(i=0;i<pnum;i++)
{
cap[1][i]--;
if(cap[1][i]==0)
{
cap[0][i]=p[0][i];
cap[1][i]=p[1][i];
}
}
}
file.close();
}
int main()
{
pro ob1;
ob1.get();
ob1.display();
int c=ob1.check();
if(c==0)
{
cout<<"nScheduling is not possiblen";
}
else
{
cout<<"nScheduling is possiblen";
sch();
}
return 0;
}
Page 4

5. Rate Monotonic Scheduling
Page 5