![]() Waiting Time = turnaround time – burst time ![]() ![]() Waiting Time is the difference between turnaround time and burst time Turnaround Time = completion of a process – submission of a process Turnaround Time is the time interval between the submission of a process and its completion. Completion Time is the time required by the process to complete its execution.What is the Turnaround time, waiting time and completion time? Shortest Job First is more desirable than FIFO algorithm because SJF is more optimal as it reduces average wait time which will increase the throughput. In this, scheduler selects the process from the waiting queue with the least completion time and allocate the CPU to that job or process. Shortest job first scheduling is the job or process scheduling algorithm that follows the nonpreemptive scheduling discipline. What is the shortest job first scheduling? Given process, the burst time of a process respectively and a quantum limit the task is to find and print the waiting time, turnaround time and their respective average time using Shortest Job First Scheduling non-preemptive method.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |