Content deleted Content added
Adding short description: "Scheduling model" |
|||
(13 intermediate revisions by 11 users not shown) | |||
Line 1:
{{Short description|Scheduling model}}
'''Run-to-completion scheduling''' is a [[scheduling (computing)|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 [[deadline]]s. ▼
{{more citations needed|date=January 2021}}
▲'''Run-to-completion scheduling''' or '''nonpreemptive scheduling''' is a [[scheduling (computing)|scheduling]] model in which each task runs until it either finishes, or explicitly yields control back to the scheduler.<ref>{{Cite
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 ==
* [[Preemptive multitasking]]
* [[Cooperative multitasking]]
==References==
{{Reflist}}
[[Category:Algorithms]]
|