Run-to-completion scheduling: Difference between revisions

Revision as of 14:03, 11 November 2012

Latest revision as of 00:28, 15 September 2024

(16 intermediate revisions by 12 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 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.

{{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 Runbook|title=Modern tooperating systems.|last=Tanenbaum|first=Andrew S.|publisher=Pearson|year=2015|isbn=9780133591620|edition=4th|pages=153|oclc=870646449}}</ref> Run-to-completion systems typically have either 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 6 ⟶ 9:

* [[Preemptive multitasking]]

* [[Cooperative multitasking]]

==References==

{{Reflist}}

[[Category:Algorithms]]

{{compsci-stub}}