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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
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
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
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
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
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
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
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
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
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
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?