Runtime analysis of application binaries for function level parallelism potential using QEMU

Butt, Khansa; Qadeer, Abdul; Mustafa, Ghulam; Waheed, Abdul

doi:10.1109/icosst.2012.6472824

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic data-flow analyses have been presented to provide useful performance feedback. The detection of parallelism (such as vectorization) along canonical directions has particularly been investigated [3,12,21,37,38,41,67,70,74], as it requires only relatively localized information. Another use case is the evaluation of effective reuse [8,10,44,46] with the objective of pinpointing data-locality problems.…”

Section: Related Workmentioning

confidence: 99%

Data-flow/dependence profiling for structured transformations

Gruber

Selva

Sampaio

et al. 2019

Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

Profiling feedback is an important technique used by developers for performance debugging, where it is usually used to pinpoint performance bottlenecks and also to find optimization opportunities. Assessing the validity and potential benefit of a program transformation requires accurate knowledge of the data flow and dependencies, which can be uncovered by profiling a particular execution of the program.In this work we develop poly-prof, an end-to-end infrastructure for dynamic binary analysis, which produces feedback about the potential to apply complex program rescheduling. Our tool can handle both inter-and intraprocedural aspects of the program in a unified way, thus providing interprocedural transformation feedback.

show abstract

Section: Related Workmentioning

confidence: 99%

Data-flow/dependence profiling for structured transformations

Gruber

Selva

Sampaio

et al. 2019

Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

show abstract

Building a Polyhedral Representation from an Instrumented Execution

Selva

Gruber

Sampaio

et al. 2019

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

The polyhedral model has been successfully used in production compilers. Nevertheless, only a very restricted class of applications can benefit from it. Recent proposals investigated how runtime information could be used to apply polyhedral optimization on applications that do not statically fit the model. In this work, we go one step further in that direction. We propose the folding-based analysis that, from the output of an instrumented program execution, builds a compact polyhedral representation. It is able to accurately detect affine dependencies, fixed-stride memory accesses, and induction variables in programs. It scales to real-life applications, which often include some nonaffine dependencies and accesses in otherwise affine code. This is enabled by a safe fine-grained polyhedral overapproximation mechanism. We evaluate our analysis on the entire Rodinia benchmark suite, enabling accurate feedback about the potential for complex polyhedral transformations. CCS Concepts: • Software and its engineering → Compilers;

show abstract

Runtime analysis of application binaries for function level parallelism potential using QEMU

Cited by 2 publications

References 13 publications

Data-flow/dependence profiling for structured transformations

Data-flow/dependence profiling for structured transformations

Building a Polyhedral Representation from an Instrumented Execution

Contact Info

Product

Resources

About