University of Cambridge > > Computer Laboratory Programming Research Group Seminar > Automatic Identification and Parallelisation of General Reduction Operations

Automatic Identification and Parallelisation of General Reduction Operations

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

If you have a question about this talk, please contact Alan Mycroft.

Discovering and exploiting reduction parallelism hasbeen studied for many years but no current approach scales well beyond simplistic scalar reductions with low arithmetic intensity. In this paper we develop a new approach that automatically detects a wide class of performance critical reductions in established benchmark suites. This approach is based on a constraint formulation of the reduction idiom and has been implemented as an LLVM pass. We use a customized constraint solver to identify program subsets that adhere to the constraint specification. Once discovered, we automatically generate parallel code to exploit the reduction. This approach is robust and was evaluated on C versions of three well known benchmark suites: NAS , Parboil and Rodinia. We detected 84 scalar reductions and 6 histograms, outperforming existing approaches and show that exploiting histograms gives significant performance improvement.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity