Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,031,197 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.
Highly Cited
2015
Highly Cited
2015
Mosaic: cross-platform user-interaction record and replay for the fragmented android ecosystem
Matthew Halpern
,
Yuhao Zhu
,
R. Peri
,
V. Reddi
IEEE International Symposium on Performance…
2015
Corpus ID: 7783699
In contrast to traditional computing systems, such as desktops and servers, that are programmed to perform “compute-bound” and…
Expand
Highly Cited
2010
Highly Cited
2010
Permissive dynamic information flow analysis
Thomas H. Austin
,
C. Flanagan
ACM Workshop on Programming Languages and…
2010
Corpus ID: 9112469
A key challenge in dynamic information flow analysis is handling implicit flows, where code conditional on a private variable…
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
Highly Cited
2005
Highly Cited
2005
Test prioritization for pairwise interaction coverage
Renée C. Bryce
,
C. Colbourn
ACM SIGSOFT Softw. Eng. Notes
2005
Corpus ID: 12642903
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing…
Expand
Highly Cited
2004
Highly Cited
2004
A fixed-point iteration approach for multibody dynamics with contact and small friction
M. Anitescu
,
G. D. Hart
Mathematical programming
2004
Corpus ID: 9841821
Abstract.Acceleration–force setups for multi-rigid-body dynamics are known to be inconsistent for some configurations and…
Expand
Review
2003
Review
2003
IBM PowerNP network processor: Hardware, software, and applications
James R. Allen
,
B. Bass
,
+13 authors
M. Waldvogel
IBM Journal of Research and Development
2003
Corpus ID: 16278401
Deep packet processing is migrating to the edges of service provider networks to simplify and speed up core functions. On the…
Expand
Highly Cited
2003
Highly Cited
2003
A Wavelet-Based Anytime Algorithm for K-Means Clustering of Time Series
M. Vlachos
,
Jessica Lin
,
Eamonn J. Keogh
,
D. Gunopulos
2003
Corpus ID: 18338443
The emergence of the field of data mining in the last decade has sparked an increasing interest in clustering of time series…
Expand
Highly Cited
2002
Highly Cited
2002
A non-blocking parallel spatial join algorithm
Gang Luo
,
J. Naughton
,
Curt J. Ellmann
Proceedings / International Conference on Data…
2002
Corpus ID: 61731246
Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non…
Expand
2002
2002
The eclogites of the Marun-Keu complex, Polar Urals (Russia): fluid control on reaction kinetics and metasomatism during high P metamorphism $
J. Molina
,
H. Austrheim
,
J. Glodny
,
A. Rusin
2002
Corpus ID: 18637089
Highly Cited
2000
Highly Cited
2000
Modeling the Dynamics of UML State Machines
E. Börger
,
A. Cavarra
,
E. Riccobene
Abstract State Machines
2000
Corpus ID: 7198642
We define the dynamic semantics of UML State Machines which integrate statecharts with the UML object model. The use of ASMs…
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