Performance estimation for task graphs combining sequential path profiling and control dependence regions

Fabrizio Ferrandi, Marco Lattuada, Christian Pilato, Antonino Tumeo
2009 2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design  
The speed-up estimation of a parallelized code is crucial to efficiently compare different parallelization techniques or task graph transformations. Unfortunately, most of the times, during the parallelization of a specification, the information that can be extracted by profiling the corresponding sequential one (e.g. the most executed paths) are not properly taken into account. In particular, correlating sequential path profiling with the corresponding parallelized code can help in the
more » ... cation of code hot spots, opening new possibilities for automatic parallelization. For this reason, starting from a well-known profiling technique, the Efficient Path Profiling, we propose a methodology that statically estimates the speed-up of a parallelized specification, just using the corresponding hierarchical task graph representation and the information coming from the dynamic profiling of the initial sequential specification. Experimental results show that the proposed solution outperforms existing approaches.
doi:10.1109/memcod.2009.5185389 dblp:conf/memocode/FerrandiLPT09 fatcat:3ksukq3pbrciheii7msiqw2hkq