Mesure comparative et optimisation des points chauds

Welcome to Benchmarking and Hotspot Optimization! In this lesson, we'll learn how to measure your code's performance and find areas for improvement.

Benchmarking is the process of measuring the performance characteristics of a program or a specific part of it. This usually involves running the code multiple times and collecting statistics like execution time and memory usage.

You might think you know which part of your code is slow, but often, intuition can be misleading. This is why the adage "Don't guess, measure!" is vital in performance tuning.

Benchmarking provides objective, empirical data to identify bottlenecks. Without it, you risk spending time optimizing the wrong parts of your application, leading to minimal or no performance gains.

For robust benchmarking in Clojure, the criterium library is the de facto standard. It handles common pitfalls of micro-benchmarking on the JVM, such as:

• Warm-up: Running code multiple times to allow the JVM's JIT compiler to optimize it.
• Garbage Collection: Minimizing its interference with measurements.
• Statistical Analysis: Providing reliable metrics like mean, median, and standard deviation.

To use Criterium, you first need to add it as a dependency in your project (e.g., in project.clj or deps.edn). Then, you can use the bench macro from criterium.core.

The bench macro takes an expression and runs it repeatedly, measuring its performance. Let's see a simple example:

When you run a Criterium benchmark, it outputs detailed statistics. Here are the key metrics to look for:

• Mean: The average execution time.
• Median: The middle execution time when sorted, less sensitive to outliers.
• StdDev: Standard Deviation, indicating the variability of results. Lower is better.
• Iterations / sec: How many times the code can run per second.

Focus on the Mean and Median for typical performance, and StdDev to ensure consistency.

A hotspot is a section of code that consumes a disproportionately large amount of execution time. Benchmarking helps you pinpoint these areas precisely.

Often, you'll start with a broader benchmark (e.g., an entire function), and if it's slow, you'll drill down by benchmarking smaller, critical sections within that function until you find the exact bottleneck.

Once a hotspot is identified, apply targeted optimizations. Common strategies include:

• Reducing Allocations: Creating fewer new objects, especially in tight loops.
• Using Primitives: Leveraging Java primitive types (e.g., int, long) for numerical computations via type hints or direct Java interop.
• Memoization: Caching results of expensive pure functions.
• Algorithm Choice: Selecting more efficient algorithms or data structures.

Let's compare two ways to sum a large sequence of numbers. The first uses standard Clojure functions, the second uses direct Java interop with primitive types for potentially better performance in a hotspot.

Notice how type hints (^long) and Java array access (aget) can guide the JVM to produce more efficient code for numerical tasks.

To get reliable benchmark results:

• Isolate Code: Benchmark only the specific section you care about.
• Consistent Environment: Run benchmarks on a consistent system with minimal background processes.
• Realistic Data: Use data that reflects your actual application's usage.
• Multiple Runs: Criterium handles this, but be aware that a single run is rarely enough.

Always re-benchmark after making changes to verify improvements.

You've learned about benchmarking and hotspot optimization. Let's test your understanding!

In this lesson, you've gained a solid understanding of benchmarking and hotspot optimization:

• We learned that benchmarking provides objective data to identify performance bottlenecks.
• We explored criterium as Clojure's go-to benchmarking library and how to interpret its results.
• You saw how to identify hotspots and apply targeted optimization strategies, including leveraging Java primitives.

Remember: always measure before optimizing!