Homework Solution: For this example, how large of a quantum value will Round Robin need to be for it to mimic FCFS?…

    For this example, how large of a quantum value will Round Robin need to be for it to mimic FCFS? EntriesAverage Time Name Key Time Processes Finished CPU Utilization Throughput CSTLA CPUIOCPUIO 00993611 0.00113.1611 229208|| 8.7기 10.00 01000010-00110.431 229208|| 8.7기 10.00 009950 0.001117.1512107 2089510.00 009970 0.001 16.35 518 208 3.86110.00 009936 0.001115.55 315 208 6.3510.00 1 FCFS 2012.91 myrun 3 RR 1 2009.99 myrun 4 RR 5 2005.95 myrun-5ER 1012012.9 201-201 myrun6ER132012.911-201 20 myrun 기RR 201201 2.911-201-201 myrun 8ER 2512012.91「一2011-201 993 59「00993610.00115 51 3151208][ 6.35][ 10.00! 009936 0.00 14.89 285 2087.0210.00 009936 0.00 14.16 258 2087.7510.00 009936 0.00 14.23 258 2087.7510.00 NameKevAverage Minimum MaximumSDAverage Minimum MaximumSD myrun 1|| FCFS| 152898|| 950.0이 2012.91|443.37|1324.98|| 830.06|| 170291|18.14 1 . 31.54|1880.0이 2847 myrun 3||RR1||1928.06|| 1847.5기 2009.99||6437|| 1724.06|| 169776| 1754.58|| .97 myrun 4RR 5 1843.68 1627.562005.95141.89 1639.681507.561729.573.17 myrun 5]|RR101し768. 55][ 1478.731 2012.91 20302|1564.55][ 1358.75]| 1702.91し6.17 myrun 6 RR 151702.661317.20 2012.91 269.621498.66|1197.201702.91 9.48 myrun_7||RR 2011 1629.21|| 1235.1기 2012.91||339.86|| 1425.21|| 1115.12|| 1702.91||12.93 myrun-8IRR 251635.96| 270.1 2012.91][332.46 [143 1.96 1150. 1211702.911256| myrun_2|SJF 1246.93391.54 2000.00494.361042.93 RR 25 1635.96 1270.12 2012.91 332.46 1431 96 1150.12 30-5-7 33|3|3 || |
    EntriesAverage Time Name Key Time Processes Finished CPU Utilization Throughput CSTLA CPUIOCPUIO 00993611 0.00113.1611 229208|| 8.7기 10.00 01000010-00110.431 229208|| 8.7기 10.00 009950 0.001117.1512107 2089510.00 009970 0.001 16.35 518 208 3.86110.00 009936 0.001115.55 315 208 6.3510.00 1 FCFS 2012.91 myrun 3 RR 1 2009.99 myrun 4 RR 5 2005.95 myrun-5ER 1012012.9 201-201 myrun6ER132012.911-201 20 myrun 기RR 201201 2.911-201-201 myrun 8ER 2512012.91「一2011-201 993 59「00993610.00115 51 3151208][ 6.35][ 10.00! 009936 0.00 14.89 285 2087.0210.00 009936 0.00 14.16 258 2087.7510.00 009936 0.00 14.23 258 2087.7510.00 NameKevAverage Minimum MaximumSDAverage Minimum MaximumSD myrun 1|| FCFS| 152898|| 950.0이 2012.91|443.37|1324.98|| 830.06|| 170291|18.14 1 . 31.54|1880.0이 2847 myrun 3||RR1||1928.06|| 1847.5기 2009.99||6437|| 1724.06|| 169776| 1754.58|| .97 myrun 4RR 5 1843.68 1627.562005.95141.89 1639.681507.561729.573.17 myrun 5]|RR101し768. 55][ 1478.731 2012.91 20302|1564.55][ 1358.75]| 1702.91し6.17 myrun 6 RR 151702.661317.20 2012.91 269.621498.66|1197.201702.91 9.48 myrun_7||RR 2011 1629.21|| 1235.1기 2012.91||339.86|| 1425.21|| 1115.12|| 1702.91||12.93 myrun-8IRR 251635.96| 270.1 2012.91][332.46 [143 1.96 1150. 1211702.911256| myrun_2|SJF 1246.93391.54 2000.00494.361042.93 RR 25 1635.96 1270.12 2012.91 332.46 1431 96 1150.12 30-5-7 33|3|3 || |

    Expert Answer

    3.) SJF- Shortest Job First algoithm executes t

    Coercion this development, how catholic of a quantum esteem achieve Rotund Robin need to be coercion it to ape FCFS?

    EntriesMean Spell Name Key Spell Arrangementes Finished CPU Utilization Throughput CSTLA CPUIOCPUIO 00993611 0.00113.1611 229208|| 8.7기 10.00 01000010-00110.431 229208|| 8.7기 10.00 009950 0.001117.1512107 2089510.00 009970 0.001 16.35 518 208 3.86110.00 009936 0.001115.55 315 208 6.3510.00 1 FCFS 2012.91 myrun 3 RR 1 2009.99 myrun 4 RR 5 2005.95 myrun-5ER 1012012.9 201-201 myrun6ER132012.911-201 20 myrun 기RR 201201 2.911-201-201 myrun 8ER 2512012.91「一2011-201 993 59「00993610.00115 51 3151208][ 6.35][ 10.00! 009936 0.00 14.89 285 2087.0210.00 009936 0.00 14.16 258 2087.7510.00 009936 0.00 14.23 258 2087.7510.00 NameKevMean Poverty ConsummationSDMean Poverty ConsummationSD myrun 1|| FCFS| 152898|| 950.0이 2012.91|443.37|1324.98|| 830.06|| 170291|18.14 1 . 31.54|1880.0이 2847 myrun 3||RR1||1928.06|| 1847.5기 2009.99||6437|| 1724.06|| 169776| 1754.58|| .97 myrun 4RR 5 1843.68 1627.562005.95141.89 1639.681507.561729.573.17 myrun 5]|RR101し768. 55][ 1478.731 2012.91 20302|1564.55][ 1358.75]| 1702.91し6.17 myrun 6 RR 151702.661317.20 2012.91 269.621498.66|1197.201702.91 9.48 myrun_7||RR 2011 1629.21|| 1235.1기 2012.91||339.86|| 1425.21|| 1115.12|| 1702.91||12.93 myrun-8IRR 251635.96| 270.1 2012.91][332.46 [143 1.96 1150. 1211702.911256| myrun_2|SJF 1246.93391.54 2000.00494.361042.93 RR 25 1635.96 1270.12 2012.91 332.46 1431 96 1150.12 30-5-7 33|3|3 || |

    EntriesMean Spell Name Key Spell Arrangementes Finished CPU Utilization Throughput CSTLA CPUIOCPUIO 00993611 0.00113.1611 229208|| 8.7기 10.00 01000010-00110.431 229208|| 8.7기 10.00 009950 0.001117.1512107 2089510.00 009970 0.001 16.35 518 208 3.86110.00 009936 0.001115.55 315 208 6.3510.00 1 FCFS 2012.91 myrun 3 RR 1 2009.99 myrun 4 RR 5 2005.95 myrun-5ER 1012012.9 201-201 myrun6ER132012.911-201 20 myrun 기RR 201201 2.911-201-201 myrun 8ER 2512012.91「一2011-201 993 59「00993610.00115 51 3151208][ 6.35][ 10.00! 009936 0.00 14.89 285 2087.0210.00 009936 0.00 14.16 258 2087.7510.00 009936 0.00 14.23 258 2087.7510.00 NameKevMean Poverty ConsummationSDMean Poverty ConsummationSD myrun 1|| FCFS| 152898|| 950.0이 2012.91|443.37|1324.98|| 830.06|| 170291|18.14 1 . 31.54|1880.0이 2847 myrun 3||RR1||1928.06|| 1847.5기 2009.99||6437|| 1724.06|| 169776| 1754.58|| .97 myrun 4RR 5 1843.68 1627.562005.95141.89 1639.681507.561729.573.17 myrun 5]|RR101し768. 55][ 1478.731 2012.91 20302|1564.55][ 1358.75]| 1702.91し6.17 myrun 6 RR 151702.661317.20 2012.91 269.621498.66|1197.201702.91 9.48 myrun_7||RR 2011 1629.21|| 1235.1기 2012.91||339.86|| 1425.21|| 1115.12|| 1702.91||12.93 myrun-8IRR 251635.96| 270.1 2012.91][332.46 [143 1.96 1150. 1211702.911256| myrun_2|SJF 1246.93391.54 2000.00494.361042.93 RR 25 1635.96 1270.12 2012.91 332.46 1431 96 1150.12 30-5-7 33|3|3 || |

    Expert Confutation

    3.) SJF- Condensedest Job Chief algoithm executes the jobs with plug shatter spell chief .

    It is the optimal algorithm ; it gives poverty mean pause spell coercion a ardent established of arrangementes becuase by affecting a condensed arrangement precedently a desire individual, the pause spell of condensed arrangement decreases and the algorithm increases pause spell of the desire arrangement, so avg. pause spell decreases.

    This is consequently hold spell is adapted by C.T.- A.T.=B.T.+ W.T.(Bearing spell+ Pause spell = Shatter spell+ Arrival spell)

    Coercion pluger shatter spell, if we maintain bearing spell plug , the hold spell would be inaudible.

    While coercion the arrangementes with excellent shatter spell, excellent bearing spell can to-boot production so this overtotal produces a pluger mean pause spell

    4.)

    The achievement of Rotund Robin Scheduling depends on the dimension of spell quantum. If the quantum esteem is as-well catholic, it behaves as if it is a FCFS scheduling algorithm. If the spell quantum esteem is as-well inaudible, matter switchcs are as-well many causing subjoined lot of productionload on the CPU. .

    If twain the quantum dimension and the matter-switch overhead are plug to cipher, then RR is denominated arrangementor sharing consequently it appears to the arrangementes that they each possess its possess CPU. Total disposed arrangementes possess resembling distribute of CPU spell.

    Coercion Rotund Robin to bepossess as FCFS, the spell quantum should resembling to the consummation of Shatter spell incomplete total the arrangementes.

    e.g. judge there are three arrangementes: P1, P2, P3 with shatter spell 3,4,7 respectively then any spell quantum overhead 7ms would execute rotund robin bepossess as FCFS