Improving speculative loop parallelization via selective squash and speculation reuse

Authors:
Santhosh Sharma Ananthramu;Deepak Majeti;Sanjeev Kumar Aggarwal;Mainak Chaudhuri
Affiliations:
Indian Institute of Technology, Kanpur, Kanpur, India;Rice University, Houston, TX, USA;Indian Institute of Technology, Kanpur, Kanpur, India;Indian Institute of Technology, Kanpur, Kanpur, India
Venue:
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
Year:
2010

Citing 2
Cited 0

The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Design Space Exploration of a Software Speculative Parallelization Scheme

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speculative parallelization is a powerful technique to parallelize loops with irregular data dependencies. In this poster, we present a value-based selective squash protocol and an optimistic speculation reuse technique that leverages an extended notion of silent stores. These optimizations focus on reducing the number of squashes due to dependency violations. Our proposed optimizations, when applied to loops selected from standard benchmark suites, demonstrate an average~(geometric mean) 2.5x performance improvement. This improvement is attributed to a 94% success in speculation reuse and a 77% reduction in the number of squashed threads compared to an implementation that, in such cases of squashes, would have squashed all the successors starting from the oldest offending one.