 | This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Run-to-completion scheduling" – news · newspapers · books · scholar · JSTOR (January 2021) (Learn how and when to remove this message) |
Run-to-completion scheduling or nonpreemptive scheduling is a scheduling model in which each task runs until it either finishes, or explicitly yields control back to the scheduler. Run-to-completion systems typically have an event queue which is serviced either in strict order of admission by an event loop, or by an admission scheduler which is capable of scheduling events out of order, based on other constraints such as deadlines.
Some preemptive multitasking scheduling systems behave as run-to-completion schedulers in regard to scheduling tasks at one particular process priority level, at the same time as those processes still preempt other lower priority tasks and are themselves preempted by higher priority tasks.
See also
References
- Tanenbaum, Andrew S. (2015). Modern operating systems (4th ed.). Pearson. p. 153. ISBN 9780133591620. OCLC 870646449.
 | This computer science article is a stub. You can help Misplaced Pages by expanding it. |