{"id":27974,"date":"2017-09-05T23:59:22","date_gmt":"2017-09-05T18:29:22","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27974"},"modified":"2017-09-05T23:59:22","modified_gmt":"2017-09-05T18:29:22","slug":"fcfs-scheduling-set-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/fcfs-scheduling-set-2\/","title":{"rendered":"FCFS Scheduling | Set 2"},"content":{"rendered":"

We have already discussed FCFS Scheduling of processes with same arrival time. In this post, scenario when processes have different arrival times are discussed. Given n processes with their burst times and arrival times, the task is to find average waiting time and average turn around time using FCFS scheduling algorithm.
\nFIFO simply queues processes in the order they arrive in the ready queue. Here, the process that comes first will be executed first and next process will start only after the previous gets fully executed.<\/p>\n

    \n
  1. Completion Time: Time at which process completes its execution.<\/li>\n
  2. Turn Around Time: Time Difference between completion time and arrival time. Turn Around Time = Completion Time \u2013 Arrival Time<\/li>\n
  3. Waiting Time(W.T): Time Difference between turn around time and burst time.
    \nWaiting Time = Turn Around Time \u2013 Burst Time<\/li>\n<\/ol>\n

    \"FCFS[ad type=”banner”]\n

    \r\nProcess     Wait Time : Service Time - Arrival Time\r\n   P0 \t                   0 - 0   = 0\r\n   P1 \t                   5 - 1   = 4\r\n   P2 \t                   8 - 2   = 6\r\n   P3 \t                   16 - 3  = 13\r\n\r\nAverage Wait Time: (0 + 4 + 6 + 13) \/ 4 = 5.75\r\n<\/pre>\n[ad type=”banner”]\n
    Service Time :<\/strong> Service time means amount of time after which a process can start execution. It is summation of burst time of previous processes (Processes that came before)<\/p>\n
    Changes in code as compare to code of FCFS with same arrival time:<\/strong>
    \nTo find waiting time: Time taken by all processes before the current process to be started (i.e. burst time of all previous processes) \u2013 arrival time of current process
    \nwait_time[i] = (bt[0] + bt[1] +\u2026\u2026 bt[i-1] ) \u2013 arrival_time[i]<\/strong><\/p>\n
    Implementation:<\/b><\/p>\n
    1- Input the processes along with their burst time(bt)\r\n   and arrival time(at)\r\n2- Find waiting time for all other processes i.e. for\r\n   a given process  i:\r\n       wt[i] = (bt[0] + bt[1] +...... bt[i-1]) - at[i] \r\n3- Now find turn around time <\/strong>\r\n          = waiting_time + burst_time for all processes\r\n4- Average waiting time<\/strong> = \r\n                    total_waiting_time \/ no_of_processes\r\n5- Average turn around time<\/strong> = \r\n                 total_turn_around_time \/ no_of_processes<\/pre>\n[ad type=”banner”]\n
    C++ Programming:<\/strong><\/p>\n
     
     <\/div> 
    \/\/ C++ program for implementation of FCFS\/\/ scheduling with different arrival time#include<iostream>using namespace std; \/\/ Function to find the waiting time for all\/\/ processesvoid findWaitingTime(int processes[], int n, int bt[],                                   int wt[], int at[]){    int service_time[n];    service_time[0] = 0;    wt[0] = 0;     \/\/ calculating waiting time    for (int i = 1; i < n ; i++)    {        \/\/ Add burst time of previous processes        service_time[i] = service_time[i-1] + bt[i-1];         \/\/ Find waiting time for current process =        \/\/ sum - at[i]        wt[i] = service_time[i] - at[i];         \/\/ If waiting time for a process is in negative        \/\/ that means it is already in the ready queue        \/\/ before CPU becomes idle so its waiting time is 0        if (wt[i] < 0)            wt[i] = 0;    }} \/\/ Function to calculate turn around timevoid findTurnAroundTime(int processes[], int n, int bt[],                                      int wt[], int tat[]){    \/\/ Calculating turnaround time by adding bt[i] + wt[i]    for (int i = 0; i < n ; i++)        tat[i] = bt[i] + wt[i];} \/\/ Function to calculate average waiting and turn-around\/\/ times.void findavgTime(int processes[], int n, int bt[], int at[]){    int wt[n], tat[n];     \/\/ Function to find waiting time of all processes    findWaitingTime(processes, n, bt, wt, at);     \/\/ Function to find turn around time for all processes    findTurnAroundTime(processes, n, bt, wt, tat);     \/\/ Display processes along with all details    cout << "Processes " << " Burst Time " << " Arrival Time "         << " Waiting Time " << " Turn-Around Time "         << " Completion Time \\n";    int total_wt = 0, total_tat = 0;    for (int i = 0 ; i < n ; i++)    {        total_wt = total_wt + wt[i];        total_tat = total_tat + tat[i];        int compl_time = tat[i] + at[i];        cout << " " << i+1 << "\\t\\t" << bt[i] << "\\t\\t"             << at[i] << "\\t\\t" << wt[i] << "\\t\\t "             << tat[i]  <<  "\\t\\t " << compl_time << endl;    }     cout << "Average waiting time = "         << (float)total_wt \/ (float)n;    cout << "\\nAverage turn around time = "         << (float)total_tat \/ (float)n;} \/\/ Driver codeint main(){    \/\/ Process id's    int processes[] = {1, 2, 3};    int n = sizeof processes \/ sizeof processes[0];     \/\/ Burst time of all processes    int burst_time[] = {5, 9, 6};     \/\/ Arrival time of all processes    int arrival_time[] = {3, 3, 6};     findavgTime(processes, n, burst_time, arrival_time);     return 0;}<\/code><\/pre> <\/div>\n
     <\/p>\n
    [ad type=”banner”]<\/strong><\/p>\n
    Output:<\/strong><\/p>\n
    Processes  Burst Time  Arrival Time  Waiting Time  Turn-Around Time  Completion Time \r\n 1\t\t5\t\t3\t\t0\t\t 5\t\t 8\r\n 2\t\t9\t\t3\t\t2\t\t 11\t\t 14\r\n 3\t\t6\t\t6\t\t8\t\t 14\t\t 20\r\nAverage waiting time = 3.33333\r\nAverage turn around time = 10<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
    FCFS Scheduling | Set 2 – Operating System – We have already discussed FCFS Scheduling of processes with same arrival time. In this post, scenario<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[71771,82275],"tags":[82462,82440,82471,82437,82473,82464,82477,82472],"class_list":["post-27974","post","type-post","status-publish","format-standard","hentry","category-cs-subjects","category-operating-systems","tag-cpu-scheduling-algorithms","tag-fcfs-scheduling-algorithm","tag-fcfs-scheduling-program-in-c","tag-preemptive-and-nonpreemptive-scheduling","tag-scheduling-algorithms-examples","tag-scheduling-algorithms-in-operating-system-with-examples-pdf","tag-sjf-scheduling","tag-sjf-scheduling-example"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27974","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27974"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27974\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27974"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27974"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27974"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}