Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Operating System

    Uploaded by

    Sathish Sät Sk
    The document compares different CPU scheduling algorithms: First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF), and Shortest Job Remaining First (SJRF). It provides the completion times, average completion times, waiting times, and average waiting times for each algorithm when run on the same set of processes with varying CPU burst times. FCFS has the highest average completion time of 21 while SJF has the lowest of 10.8. RR has the lowest average waiting time of 11.6 while FCFS has the highest of 15.2.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Operating System

    Uploaded by

    Sathish Sät Sk
    7 views3 pages
    The document compares different CPU scheduling algorithms: First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF), and Shortest Job Remaining First (SJRF). It provides the completion times, average completion times, waiting times, and average waiting times for each algorithm when run on the same set of processes with varying CPU burst times. FCFS has the highest average completion time of 21 while SJF has the lowest of 10.8. RR has the lowest average waiting time of 11.6 while FCFS has the highest of 15.2.

    Original Description:

    Original Title

    OPERATING SYSTEM

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document compares different CPU scheduling algorithms: First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF), and Shortest Job Remaining First (SJRF). It provides the completion times, average completion times, waiting times, and average waiting times for each algorithm when run on the same set of processes with varying CPU burst times. FCFS has the highest average completion time of 21 while SJF has the lowest of 10.8. RR has the lowest average waiting time of 11.6 while FCFS has the highest of 15.2.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views3 pages

    Operating System

    Uploaded by

    Sathish Sät Sk
    The document compares different CPU scheduling algorithms: First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF), and Shortest Job Remaining First (SJRF). It provides the completion times, average completion times, waiting times, and average waiting times for each algorithm when run on the same set of processes with varying CPU burst times. FCFS has the highest average completion time of 21 while SJF has the lowest of 10.8. RR has the lowest average waiting time of 11.6 while FCFS has the highest of 15.2.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    OPERATING SYSTEM​ ​SATHISH KUMAR R​ ​19BCM043

    FCCS/SJF/S RF/RR

    process Cpu burst cycle TQ

    P1 4 3

    P2 15

    P3 7

    P4 1

    P5 2

    FCFS(FIRST COME FIRST SERVE)

    P1 P2 P3 P4 P5
    0 4 19 26 27 29

    COMPLETION TIME

    P1=4
    P2=19
    P3=26
    P4=27
    P5=29
    AVERAGE COMPLETION TIME=(4+19+26+27+29)/5=21

    WAITING TIME
    P1=0
    P2=4
    P3=19
    P4=26
    P5=27
    AVG. WT=4+19+26+27/5=15.2

    ROUND ROBIN

    0 3 6 9 10 12 13 16 19 22 23 26 29
    P1 P2 P3 P4 P5 P1 P2 P3 P2 P3 P2 P2
    COMPLETION TIME

    P1=13
    P2=29
    P3=23
    P4=10
    P5=12

    AVG.CMP TIME=13+29+23+10+12=87/5=17.4

    WAITING TIME

    P1=9
    P2=14
    P3=16
    P4=9
    P5=10

    AVG.WAITING TIME=9+14+16+9+10=58/5=11.6

    SBF(SHORTEST JOB FIRST)

    P4 P5 P1 P3 P2
    0 1 3 7 14 29

    COMPLETION TIME

    P1=7
    P2=29
    P3=14
    P4=1
    P5=3

    AVG.COMPLETION TIME=(7+29+14+1+3)/5=10.8

    WAITING TIME

    P1=3
    P2=14
    P3=7
    P4=0
    P5=1

    AVG.COMPLETION TIME=(3+14+7+0+1)/5=5

    SHORTEST JOB REMAINING FIRST

    P1 P2 P3 P4 P5 P1 P3 P3 P2 P2 P2
    0 3 6 9 10 12 13 16 17 20 23 26

    P2
    26 29

    COMPLETION TIME

    P1=13
    P2=29
    P3=17
    P4=10
    P5=12

    AVERAGE WAITING TIME=(13+29+17+10+12)/5=16.2

    WAITING TIME

    P1=9
    P2=14
    P3=10
    P4=9
    P5=10

    AVG.WAITING TIME=(9+14+10+9+10)/5=10.4

    You might also like