Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems 2008
DOI: 10.1145/1450095.1450102
|View full text |Cite
|
Sign up to set email alerts
|

Non-intrusive dynamic application profiler for detailed loop execution characterization

Abstract: ABSTRACT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 30 publications
0
6
0
Order By: Relevance
“…The jump address starts a new SuperBlock. This is similar to the method used by Warp [2] and by the Dynamic Application Profiler [6], which also uses backward branches, but in their case they detect the complete loop, including the control-flow.…”
Section: Identifying Trace Segmentsmentioning
confidence: 98%
“…The jump address starts a new SuperBlock. This is similar to the method used by Warp [2] and by the Dynamic Application Profiler [6], which also uses backward branches, but in their case they detect the complete loop, including the control-flow.…”
Section: Identifying Trace Segmentsmentioning
confidence: 98%
“…In Section 2, we provide a comprehensive overview of existing software and hardware based profiling methods, discuss how such approaches can potentially change the behavior of the application and incur significant runtime overhead, and specifically highlight the nonintrusive, frequent loop detection profiler presented in Gordon-Ross and Vahid [2005]. In Section 3, we present a detailed overview of our original DAProf design presented in Nair and Lysecky [2008] that profiles an application by only monitoring short backward branches and provides detailed information regarding loop execution behavior, including the breakdown of loop executions versus average iterations per execution-providing both additional profiling information and improved accuracy compared to the frequent loop detection profiler. In Section 4, we introduce the problem of function call interference that can result in inaccurate profiling and present our extended DAProf design with support for monitoring function calls and function returns that overcomes the problem of function call interference.…”
Section: S Hw/sw = T Sw T Hw/swmentioning
confidence: 99%
“…Figure 1 presents an overview of our original dynamic application profiler [Nair and Lysecky 2008] design, highlighting its integration within a microprocessor-based system and internal profiling architecture. DAProf nonintrusively monitors the microprocessor's instruction bus to determine the address of the currently executed instruction whenever a short backward branch is executed.…”
Section: Dynamic Application Profilermentioning
confidence: 99%
“…In the case of real-time systems, which are usually designed with very tight timing constraints, the slightest run time overhead can lead to missed deadlines and potential system failure. For further details and discussion of existing software and hardware based profiling techniques, we refer the interested reader to [16] [18].…”
Section: Introductionmentioning
confidence: 99%
“…In [16], we presented an efficient, non-intrusive dynamic application profiler (DAProf) capable of profiling an executing application by monitoring the application's short backwards branches and providing detailed profiling statistics for characterizing loop execution behavior, including loop executions, average iterations per execution, and percentage of execution time. However, DAProf was originally designed to profile single task applications.…”
Section: Introductionmentioning
confidence: 99%