Approaching Symbolic Parallelization by Synthesis of Recurrence Decompositions
We present GraSSP, a novel approach to perform automated parallelization relying on recent advances in formal verification and synthesis. GraSSP augments an existing sequential program with an additional functionality to decompose data dependencies in loop iterations, to compute partial results, and...
Main Authors: | Grigory Fedyukovich, Rastislav Bodík |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2016-11-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1611.07629v1 |
Similar Items
-
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
by: Fuad Abujarad, et al.
Published: (2009-12-01) -
Distributed parallel symbolic execution
by: King, Andrew
Published: (2009) -
Symbolic Block Decomposition In Hexahedral Mesh Generation
by: Andrzej Adamek, et al.
Published: (2005-01-01) -
A Region-Based Symbolic Testing and Debugging Approach for Parallel Programming
by: Chen, Ching-Yu, et al.
Published: (2013) -
Practical domain decomposition approaches for parallel finite element analysis
by: Synn, Sang-Youp
Published: (2007)