Euro-Par 2010 - Parallel Processing

Volume 6271 of the series Lecture Notes in Computer Science pp 26-37

Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling

  • Jonathan MakAffiliated withComputer Laboratory, University of Cambridge
  • , Karl-Filip FaxénAffiliated withSwedish Institute of Computer Science
  • , Sverker JansonAffiliated withSwedish Institute of Computer Science
  • , Alan MycroftAffiliated withComputer Laboratory, University of Cambridge

* Final gross prices may vary according to local VAT.

Get Access


Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequential code.

We present an extension of Embla, a Valgrind-based dependence profiler that links dynamic dependences back to source code. This new tool estimates potential task-level parallelism in a sequential program and helps programmers exploit it at the source level. Using the popular fork-join model, our tool provides a realistic estimate of potential speed-up for parallelization with frameworks like Cilk, TBB or OpenMP 3.0 . Estimates can be given for several different parallelization models, varying in programmer effort and capabilities required of the underlying implementation. Our tool also outputs source-level dependence information to aid the parallelization of programs with lots of inherent parallelism, as well as critical paths to suggest algorithmic rewrites of programs with little of it.

We validate our claims by running our tool over serial elisions of sample Cilk programs, finding additional inherent parallelism not exploited by the Cilk code, as well as over serial C benchmarks where the profiling results suggest parallelism-enhancing algorithmic rewrites.