FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2017
0519662017

Related topics

Related topics

4 relations
Cooperative multitaskingEvent loopMicroC/OSScheduling

Related mentions per year

Related mentions per year

1953-2018
1960198020002020
Run to completion scheduling
Scheduling
Event loop
Cooperative multitasking
MicroC/OS

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 <i>implicit flows</i>, where code conditional on a private… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2009
2009
An efficient hardware-software approach to network fault tolerance with InfiniBand
In the last decade or so, clusters have observed a tremendous rise in popularity due to excellent price to performance ratio. A… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • 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… (More)
  • figure 1
  • figure 3
  • table 2
  • figure 4
  • 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… (More)
  • table 1
  • figure 2
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
A Non-Blocking Parallel Spatial Join Algorithm
Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Combinational test generation using satisfiability
We present a robust and efficient algorithm for combinational test generation using a reduction to satisfiability (SAT). The… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1993
1993
Average-Case Analysis of a Search Algorithm for Estimating Prior and Posterior Probabilities in Bayesian Networks with Extreme Probabilities
This paper provides a search based algorithm for com puting prior and posterior probabilities in discrete Bayesian Networks This… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?