Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,738,005 papers from all fields of science
Search
Sign In
Create Free Account
Run time (program lifecycle phase)
Known as:
Runtime error
, Run time
, Runtime performance
Expand
In computer science, run time, runtime or execution time is the time during which a program is running (executing), in contrast to other program…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstraction (software engineering)
Actifed (computer virus)
Akra–Bazzi method
Algorithmic learning theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks
S. Sharangi
,
Ramesh Krishnamurti
,
M. Hefeeda
IEEE transactions on multimedia
2011
Corpus ID: 15096604
The Multicast/Broadcast Service (MBS) feature of mobile WiMAX network is a promising technology for providing wireless multimedia…
Expand
Highly Cited
2010
Highly Cited
2010
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Nan Guan
,
Martin Stigge
,
W. Yi
,
Ge Yu
16th IEEE Real-Time and Embedded Technology and…
2010
Corpus ID: 1599561
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's…
Expand
Review
2008
Review
2008
Fault tolerant methods for reliability in FPGAs
Edward A. Stott
,
P. Sedcole
,
P. Cheung
International Conference on Field-Programmable…
2008
Corpus ID: 17587400
Reliability and process variability are serious issues for FPGAs in the future. Fortunately FPGAs have the ability to reconfigure…
Expand
Highly Cited
2008
Highly Cited
2008
An Efficient Fast Algorithm to Generate Codebook for Vector Quantization
H. B. Kekre
,
T. Sarode
First International Conference on Emerging Trends…
2008
Corpus ID: 28665931
In this paper we present a very simple and yet effective algorithm to generate codebook. The algorithm uses sorting method to…
Expand
Highly Cited
2006
Highly Cited
2006
AN AUTOMATED VIRUS CLASSIFICATION SYSTEM
Marius Gheorghescu
2006
Corpus ID: 16007188
In recent years, significant interest has developed around automated malware classification methods and an industry-wide naming…
Expand
Highly Cited
2005
Highly Cited
2005
Adaptive processing of top-k queries in XML
A. Marian
,
S. Amer-Yahia
,
Nick Koudas
,
D. Srivastava
IEEE International Conference on Data Engineering
2005
Corpus ID: 14418695
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories…
Expand
Highly Cited
2001
Highly Cited
2001
Optimal FPGA module placement with temporal precedence constraints
S. Fekete
,
Ekkehard Köhler
,
J. Teich
Proceedings Design, Automation and Test in Europe…
2001
Corpus ID: 9747276
We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities…
Expand
Highly Cited
2001
Highly Cited
2001
Compatibility of e -Services in a Cooperative Multi-platform Environment
Massimo Mecella
,
Barbara Pernici
,
P. Craca
Technologies for E-Services
2001
Corpus ID: 30782471
Dynamic composition and reconfiguration of e-Services in cooperative processes involving several organizations requires…
Expand
Highly Cited
1993
Highly Cited
1993
On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems
Sandra R. Thuel
,
J. Lehoczky
Proceedings Real-Time Systems Symposium
1993
Corpus ID: 33411570
This paper presents a new algorithm for the on-line scheduling of hard deadline aperiodic tasks in a real-time system in which…
Expand
Highly Cited
1985
Highly Cited
1985
Gracefully Degradable Processor Arrays
J. Fortes
,
C. Raghavendra
IEEE transactions on computers
1985
Corpus ID: 20842269
A new approach to the design of gracefully degradable processor arrays is discussed. Fault tolerance and graceful degradation are…
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