Lazy tree splitting

DOI10.1145/1863543.1863558zbMath1323.68063OpenAlexW2136424975MaRDI QIDQ5176931

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

Publication date: 5 March 2015

Published in: Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1863543.1863558

zbMATH Keywords

schedulingcompilersrun-time systemsnested-data-parallel languages

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic ⋮ Implicitly threaded parallelism in Manticore

This page was built for publication: Lazy tree splitting