InfoQ Homepage Presentations Extreme Speedups and GPGPU: A Tale of Two Practical Uses of Reified Trees
Extreme Speedups and GPGPU: A Tale of Two Practical Uses of Reified Trees
Summary
Olivier Chafik discusses how to make a practical use of reified trees in Scala, with two applications: run-time (re)compilation for extreme speed, and conversion to another language (OpenCL).
Bio
Olivier Chafik is working in London at Google on anything but Scala (not that he hasn’t tried). Olivier has worked on financial software and 3D graphics before but only gets really high on his open-source projects: JNAerator, BridJ and JavaCL. Scala has now become his experimental language of choice, with Scalaxy and ScalaCL as playground projects.
About the conference
Last year was sci-fi themed around The Hitchikers Guide to the Galaxy and the magical ’42’ number. This year we go for charm and a rich history with the Tapis Rouge salons.
This content is in the Java topic
Related Topics:
Sponsored Content
-
Related Editorial
-
Related Sponsors
-
Popular across InfoQ
-
AWS Introduces ECS Managed Instances for Containerized Applications
-
Producing a Better Software Architecture with Residuality Theory
-
GitHub Introduces New Embedding Model to Improve Code Search and Context
-
Google DeepMind Introduces CodeMender, an AI Agent for Automated Code Repair
-
Building Distributed Event-Driven Architectures across Multi-Cloud Boundaries
-
Elena Samuylova on Large Language Model (LLM)-Based Application Evaluation and LLM as a Judge
-