A provable time and space efficient implementation of NESL

DOI10.1145/232627.232650MaRDI QIDQ2817700zbMATH OpenOpenAlexFDO

Authors Guy E. Blelloch, John Greiner

Publication date 1 September 2016

Published in Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1727

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Provably efficient scheduling for languages with fine-grained parallelism
• Parallel functional arrays
• scientific article; zbMATH DE number 1875371
• scientific article; zbMATH DE number 1760064
• A calculus of functional BSP programs

Cited in

(11)

• Oracle-guided scheduling for controlling granularity in implicitly parallel languages
• A new criterion for safe program transformations
• A general framework for static cost analysis of parallel logic programs
• Two decades of automatic amortized resource analysis
• Reasonable space for the -calculus, logarithmically
• NESL
• Lazy tree splitting
• A thorough treatment of highly-efficient NTRU instantiations
• Reasonable space for the \(\lambda \)-calculus, logarithmically
• Implicitly threaded parallelism in Manticore
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework

This page was built for publication: A provable time and space efficient implementation of NESL

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