Work efficient higher-order vectorisation

DOI10.1145/2364527.2364564MaRDI QIDQ5168903zbMATH OpenOpenAlexFDO

Authors Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon Peyton-Jones

Publication date 21 July 2014

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

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

zbMATH Keywords

arraysdata parallelismHaskell

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Higher Order Flattening
• More types for nested data parallel programming
• Harnessing the multicores: nested data parallelism in Haskell
• scientific article; zbMATH DE number 1617332
• Index Vector Elimination – Making Index Vectors Affordable

Cited in

(3)

• scientific article; zbMATH DE number 1617332 (Why is no real title available?)
• Higher Order Flattening
• Cache-efficient renumbering for vectorization

This page was built for publication: Work efficient higher-order vectorisation

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