4. Conclusion
The treatment of shortest process in SJF Scheduling tends
to result in increased waiting time for long processes. And
the long process will never get served, though it produces
minimum average waiting time and average turnaround
time. It is recommended that any kind of simulation for
7. นอย
any CPU scheduling algorithm has limited accuracy.
5. Future Scope
In this paper we analyze that the process of scheduling and
the different scheduling algorithms are reviewed. The only
way to evaluate a scheduling algorithm to code it and has
to put it in the operating system, only then a proper
working capability of the algorithm can be measured in
real time systems.