Discovering Parallel Pattern Candidates
summary
Introduces PaRTE (ParaPhrase Refactoring Tool for Erlang), which applies semantics-preserving, semi-automatic source transformations to detect and introduce high-level parallel patterns that can be mapped to hardware. Focuses on identifying divide-and-conquer routines in Erlang by formalizing conditions that characterize d&c definitions and shows matched candidates found in open-source Erlang code, with tools and demonstration of the d&c pattern discovery results.
AI-written summary · about
chapters (8)
- 0:00Start
- 7:20Example: parsing modules
- 8:56Example: radix sort
- 12:11Paraphrase approach
- 19:09Pattern candidate discovery
- 24:22Standard static analyses
- 30:17Experiments
- 31:27Discovery results
related talks
23mFree the Conqueror! (Refactoring divide-and-conquer functions)
01h 02mThe sceptics guide to pattern matching
30mBuilding Single Page Web Applications with Purescript and Erlang
57mDesign Patterns: Head-first vs Emergent
01h 37mThe Art of Program Derivation and Parallel Computation
30mConcrete Syntax Metapatterns
01h 04mA Pattern Language for Expressing Concurrency in Cpp
49mMetaphorisms Deriving Divide and Conquer Recursive Programs