![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Friday 29 May 2009, 15:15-16:15
Studying task-level parallelism in C programs using Embla (work in progress)
- 👤 Speaker: Jonathan Mak (Computer Laboratory)
- 📅 Date & Time: Friday 29 May 2009, 15:15 - 16:15
- 📍 Venue: GS15, Computer Laboratory
Abstract
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]
Series This talk is part of the Computer Laboratory Programming Research Group Seminar series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- 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
- yk449
Note: Ex-directory lists are not shown.