implemented parse_processes()

Author: adhammohamed1

CPU-Scheduling-Algorithms.depend

@@ -1,12 +1,12 @@
 # depslib dependency file v1.0
-1667920358 source:c:\users\drogo\desktop\onedrive - alexandria university\term 7\operating systems\labs\cpu-scheduling-algorithms\main.cpp
+1668503039 source:c:\users\drogo\desktop\onedrive - alexandria university\term 7\operating systems\labs\cpu-scheduling-algorithms\main.cpp
 	<bits/stdc++.h>
 	"parser.h"
 
 1667920277 source:c:\users\drogo\desktop\onedrive - alexandria university\term 7\operating systems\labs\cpu-scheduling-algorithms\parser.cpp
 	<bits/stdc++.h>
 
-1667920346 c:\users\drogo\desktop\onedrive - alexandria university\term 7\operating systems\labs\cpu-scheduling-algorithms\parser.h
+1668502597 c:\users\drogo\desktop\onedrive - alexandria university\term 7\operating systems\labs\cpu-scheduling-algorithms\parser.h
 	<bits/stdc++.h>
 
 1668359983 source:c:\users\yousef\desktop\cpu-scheduling-algorithms\main.cpp

main.cpp

@@ -6,33 +6,41 @@ using namespace std;
 /** Global Constants **/
 const string TRACE = "trace";
 const string SHOW_STATISTICS = "stats";
-const string ALGORITHMS[8] = {"","FCFS","RR","SPN","SRT","HRRN","FB-1","FB-2i"};
+const string ALGORITHMS[9] = {"","FCFS","RR","SPN","SRT","HRRN","FB-1","FB-2i", "AGING"};
 
-bool sortByServiceTime(const tuple<string, int, int>& a,const tuple<string, int, int>& b){
+bool sortByServiceTime(const tuple<string, int, int>& a,const tuple<string, int, int>& b)
+{
     return (get<2>(a) < get<2>(b));
 }
-bool sortByArrivalTime(const tuple<string, int, int>& a,const tuple<string, int, int>& b){
+bool sortByArrivalTime(const tuple<string, int, int>& a,const tuple<string, int, int>& b)
+{
     return (get<1>(a) < get<1>(b));
 }
 
-string getProcessName(tuple<string, int, int>& a){
+string getProcessName(tuple<string, int, int>& a)
+{
     return get<0>(a);
 }
 
-int getArrivalTime(tuple<string, int, int>& a){
+int getArrivalTime(tuple<string, int, int>& a)
+{
     return get<1>(a);
 }
 
-int getServiceTime(tuple<string, int, int>& a){
+int getServiceTime(tuple<string, int, int>& a)
+{
     return get<2>(a);
 }
-void decrementServiceTime(tuple<string, int, int>& a){
+void decrementServiceTime(tuple<string, int, int>& a)
+{
     get<2>(a) = get<2>(a)-1;
 }
 
-void firstComeFirstServe(){
+void firstComeFirstServe()
+{
     int time=getArrivalTime(processes[0]);
-    for(int i=0;i<processes.size();i++){
+    for(int i=0; i<process_count; i++)
+    {
         string processName = getProcessName(processes[i]);
         int processIndex = processToIndex[processName];
         int arrivalTime = getArrivalTime(processes[i]);
@@ -42,41 +50,48 @@ void firstComeFirstServe(){
         turnAroundTime[processIndex]= (finishTime[processIndex]-arrivalTime);
         normTurn[processIndex]= (turnAroundTime[processIndex]*1.0/serviceTime);
 
-        for(int j = time;j<finishTime[processIndex];j++)
+        for(int j = time; j<finishTime[processIndex]; j++)
             timeline[j][processIndex]='*';
-        for(int j=arrivalTime;j<time;j++)
+        for(int j=arrivalTime; j<time; j++)
             timeline[j][processIndex]='.';
         time+=serviceTime;
     }
 }
 
-void roundRobin(){
+void roundRobin()
+{
 
 }
 
-void shortestProcessNext(){
+void shortestProcessNext()
+{
     priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq; //pair of service time and index
     int j=0;
-    for(int i=0;i<last_instant;i++){
-        for(;j<process_count;){
-            if(getArrivalTime(processes[j])<=i){
+    for(int i=0; i<last_instant; i++)
+    {
+        for(; j<process_count;)
+        {
+            if(getArrivalTime(processes[j])<=i)
+            {
                 pq.push(make_pair(getServiceTime(processes[j]),j));
                 j++;
-            }else
+            }
+            else
                 break;
         }
-        if(!pq.empty()){
+        if(!pq.empty())
+        {
             int processIndex = pq.top().second;
             int arrivalTime = getArrivalTime(processes[processIndex]);
             int serviceTime = getServiceTime(processes[processIndex]);
             pq.pop();
 
             int temp = arrivalTime;
-            for(;temp<i;temp++)
+            for(; temp<i; temp++)
                 timeline[temp][processIndex]='.';
 
             temp = i;
-            for(;temp<i+serviceTime;temp++)
+            for(; temp<i+serviceTime; temp++)
                 timeline[temp][processIndex]='*';
 
             finishTime[processIndex]= (i+serviceTime);
@@ -87,108 +102,132 @@ void shortestProcessNext(){
     }
 }
 
-void shortestRemainingTime(){
+void shortestRemainingTime()
+{
     priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
     int j=0;
-    for(int i=0;i<last_instant;i++){
-        for(;j<process_count;){
-            if(getArrivalTime(processes[j])==i){
+    for(int i=0; i<last_instant; i++)
+    {
+        for(; j<process_count;)
+        {
+            if(getArrivalTime(processes[j])==i)
+            {
                 pq.push(make_pair(getServiceTime(processes[j]),j));
                 j++;
-            }else
+            }
+            else
                 break;
         }
-        if(!pq.empty()){
+        if(!pq.empty())
+        {
             int processIndex = pq.top().second;
             int remainingTime = pq.top().first;
             pq.pop();
             int serviceTime = getServiceTime(processes[processIndex]);
             int arrivalTime= getArrivalTime(processes[processIndex]);
             timeline[i][processIndex]= '*';
 
-            if(remainingTime==1){// process finished
+            if(remainingTime==1) // process finished
+            {
                 finishTime[processIndex]= i+1;
                 turnAroundTime[processIndex]= (finishTime[processIndex]-arrivalTime);
                 normTurn[processIndex]= (turnAroundTime[processIndex]*1.0/serviceTime);
-            }else{
+            }
+            else
+            {
                 pq.push(make_pair(remainingTime-1,processIndex));
             }
         }
     }
 
-    for(int i=0;i<process_count;i++){
+    for(int i=0; i<process_count; i++)
+    {
         int arrivalTime = getArrivalTime(processes[i]);
-        for(int k=arrivalTime;k<finishTime[i];k++){
+        for(int k=arrivalTime; k<finishTime[i]; k++)
+        {
             if(timeline[k][i]!='*')
                 timeline[k][i]='.';
         }
     }
 }
 
-void highestResponseRatioNext(){
+void highestResponseRatioNext()
+{
 
 }
 
-void feedbackQ1(){
+void feedbackQ1()
+{
 
 }
 
-void feedbackQ2i(){
+void feedbackQ2i()
+{
 
 }
 
-void printAlgorithm(){
+void printAlgorithm()
+{
     cout<<ALGORITHMS[stoi(algorithms[0])]<<endl;
 }
 
-void printProcesses(){
+void printProcesses()
+{
     cout<<"Process    ";
-    for(int i=0;i<process_count;i++)
+    for(int i=0; i<process_count; i++)
         cout<<"| "<<getProcessName(processes[i])<<" ";
     cout<<"|"<<endl;
 }
-void printArrivalTime(){
+void printArrivalTime()
+{
     cout<<"Arrival    ";
-    for(int i=0;i<process_count;i++)
+    for(int i=0; i<process_count; i++)
         cout<<"| "<<getArrivalTime(processes[i])<<" ";
 
     cout<<"|"<<endl;
 }
-void printServiceTime(){
+void printServiceTime()
+{
     cout<<"Service    ";
-    for(int i=0;i<process_count;i++)
+    for(int i=0; i<process_count; i++)
         cout<<"| "<<getServiceTime(processes[i])<<" ";
     cout<<"| Mean|"<<endl;
 }
-void printFinishTime(){
+void printFinishTime()
+{
     cout<<"Finish     ";
-    for(int i=0;i<process_count;i++)
+    for(int i=0; i<process_count; i++)
         cout<<"| "<<finishTime[i]<<" ";
     cout<<"|-----|"<<endl;
 }
-void printTurnAroundTime(){
+void printTurnAroundTime()
+{
     cout<<"Turnaround ";
     int sum =0;
-    for(int i=0;i<process_count;i++){
+    for(int i=0; i<process_count; i++)
+    {
         cout<<"| "<<turnAroundTime[i]<<" ";
         sum+=turnAroundTime[i];
     }
     cout<<fixed<<setprecision(2);
     cout<<"| "<<(1.0*sum/turnAroundTime.size())<<"|"<<endl;
 }
 
-void printNormTurn(){
+void printNormTurn()
+{
     cout<<"NormTurn   ";
     cout<<fixed<<setprecision(2);
     float sum =0;
-    for(int i=0;i<process_count;i++){
+    for(int i=0; i<process_count; i++)
+    {
         cout<<"| "<<normTurn[i]<<" ";
         sum+=normTurn[i];
     }
 
     cout<<"| "<<(1.0*sum/normTurn.size())<<"|"<<endl;
 }
-void printStats(){
+void printStats()
+{
     printAlgorithm();
     printProcesses();
     printArrivalTime();
@@ -198,15 +237,18 @@ void printStats(){
     printNormTurn();
 }
 
-void printTimeline(){
+void printTimeline()
+{
     cout<<ALGORITHMS[stoi(algorithms[0])]<<" ";
-    for(int i=0;i<=last_instant;i++)
+    for(int i=0; i<=last_instant; i++)
         cout<<" "<<i%10<<" ";
     cout<<endl;
     cout<<"------------------------------------------------"<<endl;
-    for(int i=0;i<process_count;i++){
+    for(int i=0; i<process_count; i++)
+    {
         cout<<getProcessName(processes[i])<<"\t";
-        for(int j=0;j<last_instant;j++){
+        for(int j=0; j<last_instant; j++)
+        {
             cout<<"|"<<timeline[j][i];
         }
         cout<<"|"<<endl;
@@ -217,9 +259,21 @@ void printTimeline(){
 
 int main()
 {
-    freopen("input.txt","r",stdin);
+    // freopen("input.txt","r",stdin);
     parse();
-    shortestProcessNext();
+
+    /*
+    cout << endl;
+    printAlgorithm();
+    printProcesses();
+    printArrivalTime();
+    printServiceTime();
+    cout << endl;
+    */
+
+    // shortestProcessNext();
+    firstComeFirstServe();
+
     printTimeline();
     return 0;
 }