Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

4 relations
Cooperative multitaskingEvent loopMicroC/OSScheduling (computing)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Permissive dynamic information flow analysis
A key challenge in dynamic information flow analysis is handling implicit flows, where code conditional on a private variable… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 4
Is this relevant?
2007
2007
A Formal Analysis Framework for PLEXIL
The Plan Execution Interchange Language (PLEXIL) is a rich concurrent and reactive language developed by NASA to support… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm… Expand
  • figure 1
  • figure 3
  • table 2
  • figure 4
  • figure 6
Is this relevant?
2003
2003
Extracting information from heterogeneous information sources using ontologically specified target views
Being deluged by exploding volumes of structured and unstructured data contained in databases, data warehouses, and the global… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Wavelet-Based Anytime Algorithm for K-Means Clustering of Time Series
The emergence of the field of data mining in the last decade has sparked an increasing interest in clustering of time series… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2003
2003
A method for describing the syntax and semantics of UML statecharts
In this article we present a method for describing the language of UML statecharts. Statecharts are syntactically defined as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 10
  • figure 13
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Asynchronous protocols for optimistic fair exchange
The optimistic approach of involving a third party only in the case of exceptions is a useful technique to build secure, yet… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies
The performance potential of run-to-completion (RTC) parallel processor scheduling policies is investigated by examining whether… Expand
  • figure 2.1
  • figure 2.2
  • figure 4.1
  • figure 4.2
  • figure 4.3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A mechanically verified language implementation
This paper briefly describes a programming language, its implementation on a microprocessor via a compiler and link-assembler… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Explaining and Repairing Plans that Fail
A persistent problem in machine planning is that of repairing plans that fail. Two solutions have been suggested to deal with… Expand
  • figure 11
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE