Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Run-to-Completion Scheduling

Optimization Algorithm

Run-to-completion scheduling, also called nonpreemptive scheduling, is a scheduling model in which each task runs until it either finishes or explicitly yields control back to the scheduler, rather than being interrupted partway through. Tasks are usually managed through an event queue, processed either in the order they arrive or reordered by an admission scheduler according to constraints such as deadlines, and the model is used in systems where preempting a task mid-execution is undesirable or unnecessary; it can also be combined with preemptive multitasking at particular priority levels within a larger system. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Sources
Wikipedia: Run-to-completion scheduling
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.