Jump to content

Run-to-completion scheduling

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gigacephalus (talk | contribs) at 13:58, 11 November 2012 (a scheduling (computing) model i). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Run-to-completion scheduling is a 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.

Compare with preemptive multitasking.