Summary
Keywords
Full Transcript
In this lecture, we will discuss one of the most efficient CPU scheduling algorithms. This algorithm is called the shortest job first (SJF) CPU scheduling algorithm. Another way to schedule jobs is to pick the job that will take the least amount of time to complete. In FCFS scheduling, the average waiting time could be reduced by running the short jobs first. There are two possible schemes of this algorithm: Non-preemptive: Once the CPU is given a process it cannot be preempted until the current CPU burst finishes. Preemptive: If a new process arrives with a shorter CPU burst than the remaining CPU burst of the currently executing process, it replaces the currently executing process. It is also called the shortest remaining time first. Computer Science 11th Class Lectures: ******************* Chapter 4 Playlist: https://www.youtube.com/watch?v=AXTSK1lTKF4&list=PLZKMpv2xHQ9JHoQKZxjmympt1rlc05Mtu ******************** Chapter 4 Playlist: https://www.youtube.com/watch?v=eIlQgg3GUrQ&list=PLZKMpv2xHQ9LBT-891_p-iM1o7AxKySUf ******************** Chapter 5 Playlist: https://www.youtube.com/watch?v=wzuC7htHAc4&list=PLZKMpv2xHQ9ISork3fcIR_SefA9mHrt0a ******************** Chapter 3 https://www.youtube.com/watch?v=JYR6n0MdGh0&list=PLZKMpv2xHQ9K3xYm8mDrgsNwCpjv_4HW2 ******************** BSCS - BSIT - BSSE - University Lectures ******************** Operating System Playlist: https://www.youtube.com/watch?v=Bxw3tNQqVCs&list=PLZKMpv2xHQ9JoYOPf7mdgoO2RAvPhrlJI ******************** C++ Object Oriented Programming Playlist: https://www.youtube.com/watch?v=FxGVl8yOm7M&list=PLZKMpv2xHQ9LE6C4Dto0dGPkATuh8iOK_ ******************** Database Management System Playlist: https://www.youtube.com/watch?v=848LY-TsI70&list=PLZKMpv2xHQ9LbsEZNIzwBqpu7_lbsTpP- Lecture By Talha Tufail Follow us on Facebook: https://facebook.com/csconceptsp
