Studying task-level parallelism in C programs using Embla (work in progress)

Add to your list(s) Download to your calendar using vCal

• Jonathan Mak (Computer Laboratory)
• Friday 29 May 2009, 15:15-16:15
• GS15, Computer Laboratory.

If you have a question about this talk, please contact Dominic Orchard.

Efforts to extract threads from sequential imperative programs have generally had moderate success, but what exactly are the reasons behind this? In this talk I will present Embla, a dependency profiler based on Valgrind that enables us to dynamically pin down parallelism-limiting dependencies. I will present the results of using Embla to analyse limits of task-level parallelism in the SPEC integer benchmarks. I will also discuss what it is that restricts parallelism in these programs, and what we can do to increase the potential for parallelism. [Joint work with Farl-Filip Faxén and Sverker Janson]

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Programming Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• GS15, Computer Laboratory
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.