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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
In contrast to traditional computing systems, such as desktops and servers, that are programmed to perform “compute-bound” and… 
Highly Cited
2010
Highly Cited
2010
A key challenge in dynamic information flow analysis is handling implicit flows, where code conditional on a private variable… 
Review
2005
Review
2005
In this paper we present a reformulation of a sentencegeneration algorithm for context free grammars, originally due to Purdom… 
Highly Cited
2005
Highly Cited
2005
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing… 
Highly Cited
2004
Highly Cited
2004
Abstract.Acceleration–force setups for multi-rigid-body dynamics are known to be inconsistent for some configurations and… 
Review
2003
Review
2003
Deep packet processing is migrating to the edges of service provider networks to simplify and speed up core functions. On the… 
Highly Cited
2003
Highly Cited
2003
The emergence of the field of data mining in the last decade has sparked an increasing interest in clustering of time series… 
Highly Cited
2002
Highly Cited
2002
Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non… 
Highly Cited
2000
Highly Cited
2000
We define the dynamic semantics of UML State Machines which integrate statecharts with the UML object model. The use of ASMs…