Saved Bookmarks
| 1. |
Describe About Preemptive Scheduling Algorithm? |
|
Answer» A preemptive scheduling algorithm picks a PROCESS and lets it run for a maximum of some fixed time. If it is still running at the end of the time interval, it is suspended and the SCHEDULER picks ANOTHER process to run. Doing preemptive scheduling REQUIRES having a clock interrupt occur at the end of the time interval to give control of the CPU BACK to the scheduler. A preemptive scheduling algorithm picks a process and lets it run for a maximum of some fixed time. If it is still running at the end of the time interval, it is suspended and the scheduler picks another process to run. Doing preemptive scheduling requires having a clock interrupt occur at the end of the time interval to give control of the CPU back to the scheduler. |
|