JAX London, 5-8 October 2020
The Online Conference for Java & Software Innovation

Complicating Complexity: Algorithm Performance in the New Machine Age

This talk originates from the archive. To the CURRENT program
Where the Java community meets online! Until we start: ✓ Team discounts ✓ All inclusive4-day-passes still available Register now

More talks in the program:

Wednesday, October 11 2017
10:30 - 11:20
Room D+E

It’s no simple matter to explain the performance of even a simple Java program, when instruction execution time is often overshadowed by other costs. Even when network and IO have been taken into account, two programs with similar computational complexity—their big-O characteristics—can differ in cache usage, with big resulting differences in performance.

For the Java programmer, this means that big-O analysis no longer gives enough guidance in choosing a collection implementation for performance-critical code. In this talk we’ll explore optimization of the memory layout and performance of some simple programs via alternative collection implementations and frameworks, and the open-source ObjectLayout library.

Behind the Tracks

Software Architecture & Design
Software innovation & more
Architecture structure & more
Agile & Communication
Methodologies & more
Emerging Technologies
Everything about the latest technologies
DevOps & Continuous Delivery
Delivery Pipelines, Testing & more
Cloud & Modern Infrastructure
Everything about new tools and platforms
Big Data & Machine Learning
Saving, processing & more