A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
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 thedoi:10.1109/memcod.2009.5185389 dblp:conf/memocode/FerrandiLPT09 fatcat:3ksukq3pbrciheii7msiqw2hkq