Run-to-completion scheduling: Difference between revisions

Revision as of 14:04, 11 November 2012

Revision as of 14:05, 11 November 2012

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 either in strict order of admission (usually by means of an [[event loop]]), or by an [[admission scheduler]], which is capable of scheduling events out of order, based on other constraints such as deadlines[[deadline]]s.

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 ==

* [[Deadline scheduling]]

* [[Preemptive multitasking]]

* [[Cooperative multitasking]]