Skip to search formSkip to main contentSkip to account menu

Run time (program lifecycle phase)

Known as: Runtime error, Run time, Runtime performance 
In computer science, run time, runtime or execution time is the time during which a program is running (executing), in contrast to other program… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstraction (software engineering)Actifed (computer virus)Akra–Bazzi methodAlgorithmic learning theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Worst Case Analysis of DRAM Latency in Multi-requestor Systems
As multi-core systems are becoming more popular in real-time embedded systems, strict timing requirements for accessing shared… 
Highly Cited
2010
Highly Cited
2010
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's… 
Highly Cited
2007
Highly Cited
2007
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set… 
Highly Cited
2001
Highly Cited
2001
Optimal FPGA module placement with temporal precedence constraints
We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities… 
Highly Cited
2001
Highly Cited
2001
Compatibility of e -Services in a Cooperative Multi-platform Environment
Dynamic composition and reconfiguration of e-Services in cooperative processes involving several organizations requires… 
Highly Cited
2000
Highly Cited
2000
Searching the web by constrained spreading activation
Highly Cited
1996
Highly Cited
1996
Efficient worst case timing analysis of data caching
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined… 
Highly Cited
1993
Highly Cited
1993
On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems
This paper presents a new algorithm for the on-line scheduling of hard deadline aperiodic tasks in a real-time system in which… 
Highly Cited
1993
Highly Cited
1993
Towards an automated tupling strategy
The tupling transformation strategy can be used to merge loops together by combining recursive calls and also to eliminate… 
Highly Cited
1980
Highly Cited
1980
An Approach to Concurrent Control Flow Checking
A control flow checking scheme capable of detecting control flow errors of programs resulting from software coding errors… 
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)