Approaching Symbolic Parallelization by Synthesis of Recurrence Decompositions

  title={Approaching Symbolic Parallelization by Synthesis of Recurrence Decompositions},
  author={Grigory Fedyukovich and Rastislav Bod{\'i}k},
  • Grigory Fedyukovich, Rastislav Bodík
  • Published in SYNT@CAV 2016
  • Computer Science
  • 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 to compose them together. We show that for some classes of the sequential prefix sum problems, such parallelization can be performed efficiently. 
    3 Citations
    Automated Synthesis of Divide and Conquer Parallelism
    • 2
    • PDF
    Verifying Safety of Functional Programs with Rosette/Unbound
    • 4
    • PDF


    From relational verification to SIMD loop synthesis
    • 50
    • PDF
    Deriving linearizable fine-grained concurrent objects
    • 98
    • PDF
    Equivalence checking using cuts and heaps
    • 167
    • PDF
    MSL: A Synthesis Enabled Language for Distributed Implementations
    • 9
    • PDF
    Synthesizing data structure transformations from input-output examples
    • 197
    • PDF
    Data-parallel finite-state machines
    • 72
    • PDF
    Data-driven equivalence checking
    • 55
    • PDF
    Synthesis Through Unification
    • 35
    • PDF
    Combinatorial sketching for finite programs
    • 596
    • PDF