2016
DOI: 10.1007/978-3-319-29604-3_11
|View full text |Cite
|
Sign up to set email alerts
|

A Transformational Approach to Parametric Accumulated-Cost Static Profiling

Abstract: Abstract. Traditional static resource analyses estimate the total resource usage of a program, without executing it. In this paper we present a novel resource analysis whose aim is instead the static profiling of accumulated cost, i.e., to discover, for selected parts of the program, an estimate or bound of the resource usage accumulated in each of those parts. Traditional resource analyses are parametric in the sense that the results can be functions on input data sizes. Our static profiling is also parametri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(36 citation statements)
references
References 35 publications
0
36
0
Order By: Relevance
“…Other optimizations include not building equations for unreachable program parts. Table 1 shows the results of the comparison between the proposed approach and our previous, program transformation-based approach (Haemmerlé et al 2016) -New and Prev respectively from now on. Column Bench shows, for each program, the entry predicate (marked with a star, e.g., sublist * ) and the predicates that are declared as cost centers (which always include the entry predicate).…”
Section: Implementation and Experimental Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Other optimizations include not building equations for unreachable program parts. Table 1 shows the results of the comparison between the proposed approach and our previous, program transformation-based approach (Haemmerlé et al 2016) -New and Prev respectively from now on. Column Bench shows, for each program, the entry predicate (marked with a star, e.g., sublist * ) and the predicates that are declared as cost centers (which always include the entry predicate).…”
Section: Implementation and Experimental Resultsmentioning
confidence: 99%
“…As already said, in this case the standard cost of a single call p(x) is the sum of its accumulated costs in all the cost centers in the program. This is formalized by Theorem 1 in (Haemmerlé et al 2016), which holds under the assumption that p is a cost center. Intuitively, predicate c is "reachable" from predicate p if c = p or c can be invoked (either directly or indirectly) by p. If p is a cost center, Theorem 1 also holds if we restrict to the set of cost centers that are reachable from p, or to the set of cost centers that are descendants (in the call stack) of p. The reason is that if p is a cost center, and another cost center c (different from p) is not reachable from p, then no part of the cost of a call to p is attributed to c. This is stated in Lemma 3.…”
Section: Appendix B Additional Comments On the Relation Of The Standamentioning
confidence: 99%
See 1 more Smart Citation
“…The model in [36] The execution of instruction sequences may give rise to other costs beyond the cost of circuit state switching, depending on the micro architecture of the processor. Resource contention due to data dependencies between instructions may cause pipeline stalls.…”
Section: Defining and Constructing An Energy Model At Isa Levelmentioning
confidence: 99%
“…A further extension of the method of generating constraints and solving them yields static energy profiling [36], which shows the distribution of energy usage over the parts of the code, rather than a single function giving the total consumption of the program.…”
Section: More Complex Analysesmentioning
confidence: 99%