| Popis: |
In nonpreemptive scheduling discipline, once the system has assigned a processor to a process, the system cannot remove that processor from that process until it runs to completion or it voluntarily relinquishes its processor. In particularly, SJF scheduling algorithm which is nonpreemptive scheduling, selects the process with least in the length of the CPU burst time and the processor executes the process. The real difficulty with Shortest Job First (SJF) scheduling is that it requires the precise knowledge of how long a process will run and the length of the next CPU burst time and usually this information is not available. In this research paper, we proposed a dual simplex method to predict the length of the next CPU burst in SJF scheduling algorithm. Our calculations and results show that, the approximate/predict value of the next CPU burst will be similar or approximate to the length of the previous requests. |
