It is not implementable because the exact Burst time for a process can't be known in advance.May suffer with the problem of starvation.Minimum average waiting and turnaround time.SJF scheduling algorithm, schedules the processes according to their burst time. In SJF scheduling, the process with the lowest burst time, among the list of available processes in the ready queue, is going to be scheduled next. Below is the code for implementing SJF Scheduling algorithm. C Program for SJF(Shortest Job First) scheduling algorithm. First, we will ask the user to enter the total number of processes and ask them to enter the burst time for each process. Shortest Job First Scheduling (Non - Preemptive) Here we will see how we will implement SJF(Shortest Job First) scheduling algorithm in C language.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |