83 search results - page 5 / 17 » Bounding Loop Iterations for Timing Analysis |
87
Voted
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
86
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
97
Voted
RTAS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper investigates how dynamic branch prediction in a microprocessor affects the predictability of execution time for software running on that processor. By means of experim...
114
click to vote
ECOOP
2012
Springer
13 years 2 months ago
2012
Springer
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
102
Voted
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...