yvsou.com

ALL

> Computer and Education

> courses

> university courses

> undergraduate courses

> Operating System

> zstu-(2021-2022)-1

> homework noticement

homework-4 Version 0
👤 Author: by writer 2021-09-26 01:17:03

Write your own example with process set, arrive time and order, cpu burst time , etc; calculate each process's waiting time and average time for various algorithms on the example, considering preemptive and non-preemptive.

Please login to reply. Login

enochdongbogmailcom • 2021-10-13 07:39:44

Given n processes with their burst times and arrival times, i am going to find the average waiting time and an average turn around time using FCFS scheduling algorithm. And secondly, considering preemptive and non-preemptive.
<ol>
<li>Completion Time: Time at which the process completes its execution.</li>
<li>Turn Around Time: Time Difference between completion time and arrival time. Turn Around Time = Completion Time – Arrival Time</li>
<li>Waiting Time(W.T): Time Difference between turn around time and burst time.
Waiting Time = Turn Around Time – Burst Time.</li>
</ol>
<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/10/3.png"><img class="alignnone size-medium wp-image-9665" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/10/3-300x144.png" alt="" width="300" height="144" /></a> PostVer 0

Please login to reply. Login

Reversion History

No reversions found.