Lazy tree splitting

DOI10.1017/S0956796812000172zbMath1252.68061MaRDI QIDQ3165522

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

Publication date: 29 October 2012

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

zbMATH Keywords

performance robustnessNested data-parallelism

Mathematics Subject Classification ID

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

Related Items (1)

Lambda calculus with algebraic simplification for reduction parallelisation: Extended study

Uses Software

• ML
• Cilk

Cites Work

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

This page was built for publication: Lazy tree splitting