Content deleted Content added
Gigacephalus (talk | contribs) rm whitespace |
Christian75 (talk | contribs) clean up using AWB |
||
Line 1:
{{unreferenced|date=December 2012}}
'''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 [[time limit|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.
Line 9:
* [[Preemptive multitasking]]
* [[Cooperative multitasking]]
{{compsci-stub}}▼
[[Category:Algorithms]]
▲{{compsci-stub}}
| |||