Parallel Generation of Postfix and Tree Forms
Abstract
Efficient parallel algorithms to obtain the postfLx and tree forms of an infix arithmetic expression are developed.The shared memory model of parallel computing is used.
Related papers
- Optimal Parallel Generation of a Computation Tree Form TOPLAS 1985
- Techniques for embedding postfix languages in Haskell Haskell 2002
- How much parallelism is there in irregular applications? PPoPP 2009
- Generic functional parallel algorithms: scan and FFT ICFP 2017
- Alchemist: A Transparent Dependence Distance Profiling Infrastructure CGO 2009
- The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer POPL 2009
- Finite-Static Code Generation PLDI 1999
- Finger trees: a simple general-purpose data structure JFP 2006