Presburger arithmetic in memory access optimization for data-parallel languages

DOI10.1007/978-3-642-40885-4_5MaRDI QIDQ2849482zbMATH OpenOpenAlexFDO

Authors Ralf Karrenberg, Marek Košta, Thomas Sturm

Publication date 20 September 2013

Published in Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40885-4_5

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
• Automatic storage management for parallel programs
• scientific article; zbMATH DE number 1975604
• scientific article; zbMATH DE number 1979549
• Generating local addresses and communication sets for data-parallel programs

Cited in

(1)

• Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems

Describes a project that uses

Uses Software

• Cumapz
• Ocelot
• MathSAT5
• CVC4
• OpenCL
• z3
• CUDA

This page was built for publication: Presburger arithmetic in memory access optimization for data-parallel languages

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