Skip to search formSkip to main contentSkip to account menu

Run to completion scheduling

Known as: Run to completion, Run-to-completion 
Run-to-completion scheduling is a scheduling model in which each task runs until it either finishes, or explicitly yields control back to the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Cooperative multitaskingEvent loopMicroC/OSScheduling (computing)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
An Exact Implicit Enumeration Algorithm for Variable Selection in Multiple Linear Regression Models Using Information Criteria
For large multivariate data sets the data analyst often wants to know the best set of independent regressors to use in a multiple… 
2009
2009
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially… 
2009
2009
Towards a distributed execution framework for JUnit test cases
JUnit is the de-facto framework for creating and executing unit tests. This paper introduces a distributed execution framework… 
Review
2005
Review
2005
A Top-down Presentation of Purdom’s Sentence- Generation Algorithm
In this paper we present a reformulation of a sentencegeneration algorithm for context free grammars, originally due to Purdom… 
2005
2005
Synthesis of real-time implementations from component-based software models
Component-based software development is an effective technique for tackling the increasing complexity of large-scale embedded… 
2005
2005
Optimizing checkpoint sizes in the C3 system
The running times of many computational science applications are much longer than the mean-time-between-failures (MTBF) of… 
2003
2003
Modeling the meaning of transitions from and to concurrent states in UML state machines
This paper completes the ASM models developed for UML state machines in [4, 5] providing new submachines covering also… 
2001
2001
The dependence list in time warp
Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this… 
2000
2000
Executing an RTOS on Simulated Hardware using Co-verification
Hardware software co-verification tools allow a designer to run software against a hardware design before a prototype has been… 
1996
1996
Friendly and efficient message handling
Since communication software spends a significant amount of time on handling incoming messages, it is desirable that message… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)