Lazy tree splitting

DOI10.1017/S0956796812000172MaRDI QIDQ3165522zbMATH OpenFDO

Authors Lars Bergström, Matthew T. Fluet, Mike Rainey, John Reppy, Adam Shaw

Publication date 29 October 2012

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796812000172

zbMATH Keywords

performance robustnessNested data-parallelism

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Recommendations

• Lazy tree splitting
• Multidimensional data structures for parallel programs description
• scientific article; zbMATH DE number 1487627
• List processing primitives for parallel computation
• \(B\)-trees with lazy parent split

Cites work

• A methodology for granularity-based control of parallelism in logic programs
• A provable time and space efficient implementation of NESL
• Algorithm + strategy = parallelism
• Finger trees: a simple general-purpose data structure
• Scheduling multithreaded computations by work stealing
• Semantics engineering with PLT Redex
• The Zipper

Cited in

(2)

• Lazy tree splitting
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study

Describes a project that uses

Uses Software

• Cilk
• ML

This page was built for publication: Lazy tree splitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165522)