Inference and declaration of independence: impact on deterministic task parallelism

Authors:
Foivos S. Zakkak;Dimitrios Chasapis;Polyvios Pratikakis;Angelos Bilas;Dimitrios S. Nikolopoulos
Affiliations:
Foundation for Research and Technology-Hellas, Heraklion, Greece;Foundation for Research and Technology-Hellas, Heraklion, Greece;Foundation for Research and Technology-Hellas, Heraklion, Greece;Foundation for Research and Technology-Hellas, Heraklion, Greece;Queen's University of Belfast, Belfast, United Kingdom
Venue:
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Year:
2012

Citing 3
Cited 0

Safe nondeterminism in a deterministic-by-default parallel language

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchronization via scheduling: techniques for efficiently managing shared state

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
BDDT:: block-level dynamic dependence analysisfor deterministic task-based parallelism

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a set of static techniques that reduce runtime overheads in task-parallel programs with implicit synchronization. We use a static dependence analysis to detect non-conflicting tasks and remove unnecessary runtime checks. We further reduce overheads by statically optimizing task creation and management of runtime metadata. We implemented these optimizations in SCOOP, a source-to-source compiler for such a programming model and runtime system. We evaluate SCOOP on 10 representative benchmarks and show that our approach can improve performance by 12% on average.