Seeing by {hardware} counters: a journey to threefold efficiency improve | by Netflix Know-how Weblog

By Vadim Filanovsky and Harshad Sane

In one among our earlier blogposts, A Microscope on Microservices we outlined three broad domains of observability (or “ranges of magnification,” as we referred to them) — Fleet-wide, Microservice and Occasion. We described the instruments and methods we use to achieve perception inside every area. There may be, nonetheless, a category of issues that requires a fair stronger degree of magnification going deeper down the stack to introspect CPU microarchitecture. On this blogpost we describe one such drawback and the instruments we used to resolve it.

It began off as a routine migration. At Netflix, we periodically reevaluate our workloads to optimize utilization of accessible capability. We determined to maneuver one among our Java microservices — let’s name it GS2 — to a bigger AWS occasion dimension, from m5.4xl (16 vCPUs) to m5.12xl (48 vCPUs). The workload of GS2 is computationally heavy the place CPU is the limiting useful resource. Whereas we perceive it’s nearly not possible to realize a linear improve in throughput because the variety of vCPUs develop, a near-linear improve is attainable. Consolidating on the bigger cases reduces the amortized price of background duties, liberating up extra sources for serving requests and doubtlessly offsetting the sub-linear scaling. Thus, we anticipated to roughly triple throughput per occasion from this migration, as 12xl cases have thrice the variety of vCPUs in comparison with 4xl cases. A fast canary take a look at was freed from errors and confirmed decrease latency, which is predicted provided that our normal canary setup routes an equal quantity of visitors to each the baseline working on 4xl and the canary on 12xl. As GS2 depends on AWS EC2 Auto Scaling to target-track CPU utilization, we thought we simply needed to redeploy the service on the bigger occasion kind and await the ASG (Auto Scaling Group) to choose the CPU goal. Sadly, the preliminary outcomes had been removed from our expectations:

The primary graph above represents common per-node throughput overlaid with common CPU utilization, whereas the second graph reveals common request latency. We will see that as we reached roughly the identical CPU goal of 55%, the throughput elevated solely by ~25% on common, falling far wanting our desired objective. What’s worse, common latency degraded by greater than 50%, with each CPU and latency patterns turning into extra “uneven.” GS2 is a stateless service that receives visitors by a taste of round-robin load balancer, so all nodes ought to obtain almost equal quantities of visitors. Certainly, the RPS (Requests Per Second) knowledge reveals little or no variation in throughput between nodes:

However as we began trying on the breakdown of CPU and latency by node, an odd sample emerged:

Though we confirmed pretty equal visitors distribution between nodes, CPU and latency metrics surprisingly demonstrated a really totally different, bimodal distribution sample. There’s a “decrease band” of nodes exhibiting a lot decrease CPU and latency with hardly any variation; and there’s an “higher band” of nodes with considerably larger CPU/latency and extensive variation. We observed solely ~12% of the nodes fall into the decrease band, a determine that was suspiciously constant over time. In each bands, efficiency traits stay constant for all the uptime of the JVM on the node, i.e. nodes by no means jumped the bands. This was our place to begin for troubleshooting.

Our first (and reasonably apparent) step at fixing the issue was to check flame graphs for the “gradual” and “quick” nodes. Whereas flame graphs clearly mirrored the distinction in CPU utilization because the variety of collected samples, the distribution throughout the stacks remained the identical, thus leaving us with no extra perception. We turned to JVM-specific profiling, beginning with the fundamental hotspot stats, after which switching to extra detailed JFR (Java Flight Recorder) captures to check the distribution of the occasions. Once more, we got here away empty-handed as there was no noticeable distinction within the quantity or the distribution of the occasions between the “gradual” and “quick” nodes. Nonetheless suspecting one thing may be off with JIT conduct, we ran some primary stats in opposition to image maps obtained by perf-map-agent solely to hit one other lifeless finish.

Satisfied we’re not lacking something on the app-, OS- and JVM- ranges, we felt the reply may be hidden at a decrease degree. Fortunately, the m5.12xl occasion kind exposes a set of core PMCs (Efficiency Monitoring Counters, a.ok.a. PMU counters), so we began by amassing a baseline set of counters utilizing PerfSpect:

Within the desk above, the nodes exhibiting low CPU and low latency signify a “quick node”, whereas the nodes with larger CPU/latency signify a “gradual node”. Except for apparent CPU variations, we will see that the gradual node has nearly 3x CPI (Cycles Per Instruction) of the quick node. We additionally see a lot larger L1 cache exercise mixed with 4x larger depend of MACHINE_CLEARS. One frequent trigger of those signs is so-called “false sharing” — a utilization sample occurring when 2 cores studying from / writing to unrelated variables that occur to share the identical L1 cache line. Cache line is an idea just like reminiscence web page — a contiguous chunk of information (usually 64 bytes on x86 methods) transferred to and from the cache. This diagram illustrates it:

Every core on this diagram has its personal non-public cache. Since each cores are accessing the identical reminiscence area, caches should be constant. This consistency is ensured with so-called “cache coherency protocol.” As Thread 0 writes to the “crimson” variable, coherency protocol marks the entire cache line as “modified” in Thread 0’s cache and as “invalidated” in Thread 1’s cache. Later, when Thread 1 reads the “blue” variable, although the “blue” variable is just not modified, coherency protocol forces all the cache line to be reloaded from the cache that had the final modification — Thread 0’s cache on this instance. Resolving coherency throughout non-public caches takes time and causes CPU stalls. Moreover, ping-ponging coherency visitors must be monitored by the last level shared cache’s controller, which ends up in much more stalls. We take CPU cache consistency with no consideration, however this “false sharing” sample illustrates there’s an enormous efficiency penalty for merely studying a variable that’s neighboring with another unrelated knowledge.

Armed with this information, we used Intel vTune to run microarchitecture profiling. Drilling down into “scorching” strategies and additional into the meeting code confirmed us blocks of code with some directions exceeding 100 CPI, which is extraordinarily gradual. That is the abstract of our findings:

Numbered markers from 1 to six denote the identical code/variables throughout the sources and vTune meeting view. The crimson arrow signifies that the CPI worth possible belongs to the earlier instruction — that is as a result of profiling skid in absence of PEBS (Processor Occasion-Primarily based Sampling), and normally it’s off by a single instruction. Primarily based on the truth that (5) “repne scan” is a reasonably uncommon operation within the JVM codebase, we had been capable of hyperlink this snippet to the routine for subclass checking (the identical code exists in JDK mainline as of the writing of this blogpost). Going into the small print of subtype checking in HotSpot is way past the scope of this blogpost, however curious readers can study extra about it from the 2002 publication Fast Subtype Checking in the HotSpot JVM. As a result of nature of the category hierarchy used on this specific workload, we hold hitting the code path that retains updating (6) the “_secondary_super_cache” subject, which is a single-element cache for the last-found secondary superclass. Observe how this subject is adjoining to the “_secondary_supers”, which is an inventory of all superclasses and is being learn (1) at first of the scan. A number of threads do these read-write operations, and if fields (1) and (6) fall into the identical cache line, then we hit a false sharing use case. We highlighted these fields with crimson and blue colours to hook up with the false sharing diagram above.

Observe that because the cache line dimension is 64 bytes and the pointer dimension is 8 bytes, we’ve got a 1 in 8 likelihood of those fields falling on separate cache traces, and a 7 in 8 likelihood of them sharing a cache line. This 1-in-8 likelihood is 12.5%, matching our earlier statement on the proportion of the “quick” nodes. Fascinating!

Though the repair concerned patching the JDK, it was a easy change. We inserted padding between “_secondary_super_cache” and “_secondary_supers” fields to make sure they by no means fall into the identical cache line. Observe that we didn’t change the useful facet of JDK conduct, however reasonably the information format:

The outcomes of deploying the patch had been instantly noticeable. The graph under is a breakdown of CPU by node. Right here we will see a red-black deployment occurring at midday, and the brand new ASG with the patched JDK taking on by 12:15:

Each CPU and latency (graph omitted for brevity) confirmed an analogous image — the “gradual” band of nodes was gone!

We didn’t have a lot time to marvel at these outcomes, nonetheless. Because the autoscaling reached our CPU goal, we observed that we nonetheless couldn’t push greater than ~150 RPS per node — properly wanting our objective of ~250 RPS. One other spherical of vTune profiling on the patched JDK model confirmed the identical bottleneck round secondary superclass cache lookup. It was puzzling at first to see seemingly the identical drawback coming again proper after we put in a repair, however upon nearer inspection we realized we’re coping with “true sharing” now. Not like “false sharing,” the place 2 impartial variables share a cache line, “true sharing” refers back to the identical variable being learn and written by a number of threads/cores. On this case, CPU-enforced memory ordering is the reason for slowdown. We reasoned that eradicating the impediment of false sharing and rising the general throughput resulted in elevated execution of the identical JVM superclass caching code path. Primarily, we’ve got larger execution concurrency, inflicting extreme strain on the superclass cache as a consequence of CPU-enforced reminiscence ordering protocols. The frequent method to resolve that is to keep away from writing to the shared variable altogether, successfully bypassing the JVM’s secondary superclass cache. Since this variation altered the conduct of the JDK, we gated it behind a command line flag. That is the whole thing of our patch:

And listed here are the outcomes of working with disabled superclass cache writes:

Our repair pushed the throughput to ~350 RPS on the identical CPU autoscaling goal of 55%. To place this in perspective, that’s a 3.5x enchancment over the throughput we initially reached on m5.12xl, together with a discount in each common and tail latency.

Disabling writes to the secondary superclass cache labored properly in our case, and although this may not be a fascinating resolution in all circumstances, we needed to share our methodology, toolset and the repair within the hope that it could assist others encountering related signs. Whereas working by this drawback, we got here throughout JDK-8180450 — a bug that’s been dormant for greater than 5 years that describes precisely the issue we had been dealing with. It appears ironic that we couldn’t discover this bug till we truly found out the reply. We imagine our findings complement the nice work that has been accomplished in diagnosing and remediating it.

We have a tendency to think about trendy JVMs as extremely optimized runtime environments, in lots of circumstances rivaling extra “performance-oriented” languages like C++. Whereas it holds true for almost all of workloads, we had been reminded that efficiency of sure workloads working inside JVMs may be affected not solely by the design and implementation of the appliance code, but in addition by the implementation of the JVM itself. On this blogpost we described how we had been capable of leverage PMCs so as to discover a bottleneck within the JVM’s native code, patch it, and subsequently understand higher than a threefold improve in throughput for the workload in query. With regards to this class of efficiency points, the power to introspect the execution on the degree of CPU microarchitecture proved to be the one resolution. Intel vTune supplies invaluable perception even with the core set of PMCs, resembling these uncovered by m5.12xl occasion kind. Exposing a extra complete set of PMCs together with PEBS throughout all occasion varieties and sizes within the cloud surroundings would pave the best way for deeper efficiency evaluation and doubtlessly even bigger efficiency good points.
Replace: After publishing this put up we had been alerted to a separate impartial improvement on this space, together with a writeup on how superclass cache affects regex pattern matching, in addition to a tool to automate the detection of JDK-8180450 utilizing an agent. Additionally of curiosity is this video describing another strategy to diagnosing the problem. Our objective in sharing our work is to supply info and perception to the open-source neighborhood, and it’s all the time thrilling to see (and share!) how others strategy related issues.