Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling

  • Jonathan Mak
  • Karl-Filip Faxén
  • Sverker Janson
  • Alan Mycroft
Conference paper

DOI: 10.1007/978-3-642-15277-1_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6271)
Cite this paper as:
Mak J., Faxén KF., Janson S., Mycroft A. (2010) Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling. In: D’Ambra P., Guarracino M., Talia D. (eds) Euro-Par 2010 - Parallel Processing. Euro-Par 2010. Lecture Notes in Computer Science, vol 6271. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jonathan Mak
    • 1
  • Karl-Filip Faxén
    • 2
  • Sverker Janson
    • 2
  • Alan Mycroft
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeUnited Kingdom
  2. 2.Swedish Institute of Computer ScienceKistaSweden

Personalised recommendations