Continuous speculative program parallelization in software

Authors:
Chao Zhang;Chen Ding;Xiaoming Gu;Kirk Kelsey;Tongxin Bai;Xiaobing Feng
Affiliations:
Intel China Research Center, Beijing, China;University of Rochester, Rochester, NY, USA;University of Rochester, Rochester, NY, USA;University of Rochester, Rochester, NY, USA;University of Rochester, Rochester, NY, USA;Chinese Academy of Sciences, Beijing, China
Venue:
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Year:
2010

Citing 1
Cited 3

RingSTM: scalable transactions with a single atomic instruction

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures

Two examples of parallel programming without concurrency constructs (PP-CC)

Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Safe parallel programming using dynamic dependence hints

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Parallel programming by hints

Proceedings of the compilation of the co-located workshops on DSM'11, TMC'11, AGERE!'11, AOOPES'11, NEAT'11, & VMIL'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of extracting coarse-grained parallelism from large sequential code. It builds on BOP, a system for software speculative parallelization. BOP lets a user to mark possibly parallel regions (PPR) in a program and at run-time speculatively executes PPR instances using Unix processes. This short paper presents a new run-time support called continuous speculation, which fully utilizes available parallelism to tolerate differences in PPR task size and processor speed.