Content deleted Content added
Gigacephalus (talk | contribs) a scheduling (computing) model i |
Gigacephalus (talk | contribs) more |
||
Line 1:
'''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 either an [[event queue]] which is serviced in strict order of admission, or 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.
Compare with [[preemptive multitasking]].▼
== See also ==
* [[Cooperative multitasking]]
{{compsci-stub}}
| |||