Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,304 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Cooperative multitasking
Event loop
MicroC/OS
Scheduling (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
Dennis J. Beal
2011
Corpus ID: 15405687
For large multivariate data sets the data analyst often wants to know the best set of independent regressors to use in a multiple…
Expand
2009
2009
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
Nehir Sönmez
,
T. Harris
,
A. Cristal
,
O. Unsal
,
M. Valero
IEEE International Symposium on Parallel…
2009
Corpus ID: 6381621
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially…
Expand
2009
2009
Towards a distributed execution framework for JUnit test cases
T. Parveen
,
S. Tilley
,
Nigel Daley
,
Pedro Morales
IEEE International Conference on Software…
2009
Corpus ID: 10576037
JUnit is the de-facto framework for creating and executing unit tests. This paper introduces a distributed execution framework…
Expand
Review
2005
Review
2005
A Top-down Presentation of Purdom’s Sentence- Generation Algorithm
B. Malloy
,
James F. Power
2005
Corpus ID: 17443224
In this paper we present a reformulation of a sentencegeneration algorithm for context free grammars, originally due to Purdom…
Expand
2005
2005
Synthesis of real-time implementations from component-based software models
Z. Gu
,
K. Shin
IEEE Real-Time Systems Symposium
2005
Corpus ID: 340637
Component-based software development is an effective technique for tackling the increasing complexity of large-scale embedded…
Expand
2003
2003
Modeling the meaning of transitions from and to concurrent states in UML state machines
E. Börger
,
E. Riccobene
,
A. Cavarra
ACM Symposium on Applied Computing
2003
Corpus ID: 2641918
This paper completes the ASM models developed for UML state machines in [4, 5] providing new submachines covering also…
Expand
2003
2003
Lightweight EDF Scheduling with Deadline Inheritance
P. Jansen
,
S. Mullender
,
P. Havinga
,
H. Scholten
2003
Corpus ID: 14165480
EDFI is a lightweight real-time scheduling protocol that combines EDF with deadline inheritance over shared resources. We will…
Expand
2001
2001
The dependence list in time warp
J. Zhang
,
C. Tropper
Proceedings 15th Workshop on Parallel and…
2001
Corpus ID: 5385882
Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this…
Expand
2000
2000
Executing an RTOS on Simulated Hardware using Co-verification
David Harris
2000
Corpus ID: 15229314
Hardware software co-verification tools allow a designer to run software against a hardware design before a prototype has been…
Expand
1996
1996
Friendly and efficient message handling
R. Bhoedjang
,
K. Langendoen
Hawaii International Conference on System…
1996
Corpus ID: 9407622
Since communication software spends a significant amount of time on handling incoming messages, it is desirable that message…
Expand
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)
ACCEPT & CONTINUE