Results 1  10
of
122,220
Determining Average Program Execution Times and their Variance
, 1989
"... This paper presents a general framework for determining average program execution times and their variance, based on the program's interval structure and control dependence graph. Average execution times and variance values are computed using frequency information from an optimized counterbase ..."
Abstract

Cited by 92 (0 self)
 Add to MetaCart
This paper presents a general framework for determining average program execution times and their variance, based on the program's interval structure and control dependence graph. Average execution times and variance values are computed using frequency information from an optimized counter
A PROBLEM OF PROGRAM EXECUTION TIME MEASUREMENT
"... Abstract. This paper discusses the problem of program execution time measurement. Program execution time measurement is problematic because the conventional measurement method, based on the realtime clock interrupt counting, is prone to inherent errors. These errors are caused by discrete nature of ..."
Abstract
 Add to MetaCart
Abstract. This paper discusses the problem of program execution time measurement. Program execution time measurement is problematic because the conventional measurement method, based on the realtime clock interrupt counting, is prone to inherent errors. These errors are caused by discrete nature
Predicting Program Execution Times by Analyzing
"... Abstract. This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a sequential program. The basic prediction technique is a static analysis based on simple timing schema for sourcelevel language constructs, which gives accurate predictions in many cases. ..."
Abstract
 Add to MetaCart
Abstract. This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a sequential program. The basic prediction technique is a static analysis based on simple timing schema for sourcelevel language constructs, which gives accurate predictions in many cases
Program Execution Time, Reliability and Queueing Analysis in
"... This term paper contains three main chapters. The first one is the analysis for program execution times with various checkpointing strategies; the second one is the expectedreliability analysis; and the last one is queueing analysis for message sojourn time in Access Bridge. All these analysis are ..."
Abstract
 Add to MetaCart
This term paper contains three main chapters. The first one is the analysis for program execution times with various checkpointing strategies; the second one is the expectedreliability analysis; and the last one is queueing analysis for message sojourn time in Access Bridge. All these analysis
A Probabilistic Approach to the Analysis of Program Execution Time
, 1998
"... We present a new approach to the performance prediction of parallel programs that provides information on the distribution of execution times when considering a large space of input data sets. The research aims to extend lowcost performance analysis techniques by accounting for the stochastic behav ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We present a new approach to the performance prediction of parallel programs that provides information on the distribution of execution times when considering a large space of input data sets. The research aims to extend lowcost performance analysis techniques by accounting for the stochastic
Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
 In International Conference on Logic Programming
, 2006
"... Motivation. Predicting statically the running time of programs has many applications ranging from task scheduling in parallel execution to proving the ability of a program to meet strict time constraints. A starting point in order to attack this problem is to infer the computational complexity of su ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Motivation. Predicting statically the running time of programs has many applications ranging from task scheduling in parallel execution to proving the ability of a program to meet strict time constraints. A starting point in order to attack this problem is to infer the computational complexity
Program Analysis and Specialization for the C Programming Language
, 1994
"... Software engineers are faced with a dilemma. They want to write general and wellstructured programs that are flexible and easy to maintain. On the other hand, generality has a price: efficiency. A specialized program solving a particular problem is often significantly faster than a general program. ..."
Abstract

Cited by 629 (0 self)
 Add to MetaCart
. However, the development of specialized software is timeconsuming, and is likely to exceed the production of today’s programmers. New techniques are required to solve this socalled software crisis. Partial evaluation is a program specialization technique that reconciles the benefits of generality
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Automatically characterizing large scale program behavior
, 2002
"... Understanding program behavior is at the foundation of computer architecture and program optimization. Many programs have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and compile ..."
Abstract

Cited by 778 (41 self)
 Add to MetaCart
Understanding program behavior is at the foundation of computer architecture and program optimization. Many programs have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and com
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
Results 1  10
of
122,220