The Performance Engineer's Guide To (OpenJDK) HotSpot Garbage Collection - The Facts, The Algorithm & Tuning.
•
10 likes•2,353 views
This document provides an overview of garbage collection in the Java Virtual Machine. It discusses key concepts like generational collection, parallel and concurrent marking, and tuning garbage collection for throughput versus latency. Specific collectors like Parallel GC, CMS GC, and G1 GC are explained in terms of their marking and compaction algorithms. Memory tuning recommendations and analyzing garbage collection logs and heap dumps are also covered. The document concludes with a high-level explanation of the Garbage First garbage collector and how it uses region-based heap management.
Recommended
More Related Content
What's hot
What's hot (20)
Viewers also liked
Viewers also liked (11)
Similar to The Performance Engineer's Guide To (OpenJDK) HotSpot Garbage Collection - The Facts, The Algorithm & Tuning.
Similar to The Performance Engineer's Guide To (OpenJDK) HotSpot Garbage Collection - The Facts, The Algorithm & Tuning. (20)
More from Monica Beckwith
Recently uploaded
Recently uploaded (20)
The Performance Engineer's Guide To (OpenJDK) HotSpot Garbage Collection - The Facts, The Algorithm & Tuning.
- 2. 2 About Me … Java/JVM/GC performance person Current Life: Consultant who solves Managed Runtime performance issues Past Life: Worked with Oracle, Sun, AMD… - Was the Performance Lead for G1 GC www.codekaram.com https://www.linkedin.com/in/monicabeckwith Tweet @mon_beck
- 3. ©2016 CodeKaram The Facts • Performance Engineering • JVM • GC • Throughput and Latency Design Considerations • Generational GC 3
- 4. ©2016 CodeKaram The Algorithm • Allocations • Thread Local Allocation Buffers (TLABs) • Reclamation • Young Collection • Old Collection • Parallel and Serial Mark-Compact • Mostly Concurrent Mark-Sweep 4
- 5. ©2016 CodeKaram Tuning • Memory Leaks • Tuning Recommendations • Tuning for Throughput • Tuning for Latency 5
- 6. ©2016 CodeKaram Extras • Garbage First Garbage Collector 6
- 8. ©2016 CodeKaram8 Performance Engineering Performance Requirements & Test Plan Development Performance Analysis
- 12. ©2016 CodeKaram12 Performance Analysis Monitoring System Under Test Utilization, Lock Stats, … Application, System, Memory, … Profiling Analyzing logs
- 14. ©2016 CodeKaram14 Java Application Java APIs Java VM OS + HardwareJRE Runtime JIT Compiler GC Class loader
- 17. ©2016 CodeKaram17 GC Performance Engineering JVM Monitoring Application Profiling Process & Plot GC logs Online & Offline GC Monitoring Heap Profiling
- 18. 18 OpenJDK HotSpot GC - Facts!
- 19. ©2016 CodeKaram Throughput and latency are the two main drivers towards refinement of GC algorithms. 19 GC Fact #1
- 20. ©2016 CodeKaram The Throughput Maximizer 20 Maximize Throughput Generational Old Parallel Work Young Concurrent Threads Stop-the- world Threads
- 21. ©2016 CodeKaram Mr. Latency Sensitive 21 Latency Sensitive Pause only when needed Concurrent Marking/Sweeping Reduce stop-the- world GC pause time No/Partial Compaction 21
- 25. ©2016 CodeKaram All GCs in OpenJDK HotSpot are generational. 25 GC Fact #2
- 27. 27 OpenJDK HotSpot GC - Algorithms!
- 30. 30 Fast Path Allocation == Lock-Free Allocation == Threads Allocate Into Their Local Allocation Buffer (LAB)s
- 31. ©2016 CodeKaram31 Eden TLAB TLAB TLAB TLAB TLAB TLAB = Thread Local Allocation Buffer
- 32. ©2016 CodeKaram32 EdenThread 1 Thread 2 Thread 3 Thread 4 TLAB TLAB TLAB TLAB TLAB Thread 0
- 36. ©2016 CodeKaram36 Young Generation Old Generation Eden S0 S1
- 37. ©2016 CodeKaram37 *Similar GC Algorithms for OpenJDK HotSpot Different GC Algorithms for OpenJDK Hotspot Always collected in its entirety Young Generation Old Generation
- 38. ©2016 CodeKaram38 Always collected in its entirety Young Generation Old Generation *Similar GC Algorithms for OpenJDK HotSpot Different GC Algorithms for OpenJDK Hotspot
- 39. 39 Young Garbage Collection == Reclamation Via Scavenging
- 40. ©2016 CodeKaram40 Old Generation Root Set Young Generation
- 44. 44 Old Garbage Collection == Different GC Algorithms
- 45. ©2016 CodeKaram The Throughput Collector Multi-Threaded Multi-Threaded - Entire Heap Marked, Swept and Compacted in its entirety Always collected in its entirety 45 Young Generation Old Generation
- 46. ©2016 CodeKaram46 Multi-Threaded Multi-Threaded - Entire Heap Marked, Swept and Compacted in its entirety Always collected in its entirety Young Generation Old Generation
- 47. ©2016 CodeKaram47 Old Generation Root Set Young Generation Garbage Collection -Reclamation via Parallel Mark-Compact
- 48. ©2016 CodeKaram Garbage Collection -Reclamation via Parallel Mark-Compact 48 Old Generation
- 49. ©2016 CodeKaram49 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation
- 50. ©2016 CodeKaram50 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation source region destination region
- 51. ©2016 CodeKaram51 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation source region destination region
- 52. ©2016 CodeKaram52 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation source region destination region source region
- 53. ©2016 CodeKaram53 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation source region destination region source region
- 54. ©2016 CodeKaram54 Garbage Collection -Reclamation via Parallel Mark-Compact Old Generation
- 55. ©2016 CodeKaram The CMS Collector Multi-Threaded Multi-Threaded - Mostly Concurrent Marked and Swept in its entirety Always collected in its entirety 55 Young Generation Old Generation
- 56. ©2016 CodeKaram The CMS Collector Multi-Threaded Multi-Threaded - Mostly Concurrent Marked and Swept in its entirety Always collected in its entirety 56 ?? Young Generation Old Generation
- 57. ©2016 CodeKaram The CMS Collector Multi-Threaded Multi-Threaded - Mostly Concurrent Marked and Swept in its entirety Always collected in its entirety 57 No Compaction!! Young Generation Old Generation
- 58. ©2016 CodeKaram Garbage Collection - Reclamation via Mark-Sweep 58 Old Generation Free List
- 59. ©2016 CodeKaram Garbage Collection - Reclamation via Mark-Sweep 59 Old Generation Free List
- 60. ©2016 CodeKaram All non/partial compacting GCs in OpenJDK HotSpot fallback* to a fully compacting stop-the-world garbage collection called the “full” GC. *Tuning can help avoid or postpone full GCs in many cases. 60
- 61. ©2016 CodeKaram Single Threaded - Entire Heap Marked, Swept and Compacted in its entirety 61 Young Generation Old Generation Garbage Collection -Reclamation via Mark-Sweep-Compact
- 62. ©2016 CodeKaram Single Threaded - Entire Heap Marked, Swept and Compacted in its entirety 62 Young Generation Old Generation Garbage Collection -Reclamation via Mark-Sweep-Compact
- 63. 63 OpenJDK HotSpot GC - Tuning!
- 64. ©2016 CodeKaram • GC can NOT eliminate your memory leaks! • GC (and heap dump) can provide an insight into your application. 64 About Memory Leaks
- 65. ©2016 CodeKaram Java and Memory Leak 65 • Automatic Memory Management • Allocation - mostly lock-free out of TLABs • Reclamation - after tracing live data tree referenced from the root set. • How can there be a leak? …. hint above :)
- 66. ©2016 CodeKaram Java and Memory Leak 66 • GC root • class loaded by class loader • static fields • threads • JNI local and global
- 67. ©2016 CodeKaram Java and Memory Leak 67 • class loader leaks • mutable static fields • ThreadLocal leaks • JNI memory leaks
- 68. ©2016 CodeKaram Java and Memory Leak 68 • Tools • GC log files • Heap dump • Heap profiling Live objects retention information
- 69. ©2016 CodeKaram Java and Memory Leak 69 • Tools • -XX:+PrintGCDetails -XX: +PrintGCTimeStamps - Xloggc:filename; parse; plot • jvisualVM; jconsole; Java Mission Control
- 70. ©2016 CodeKaram70 Total Occupied Heap Old generation Young generation Live Data Set
- 73. 73 Tuning GC For Throughput Or For Latency??
- 74. 74 GC Elapsed Time Or GC Overhead
- 75. ©2016 CodeKaram GC Elapsed Time indicated the amount of time it takes to execute stop the world GC events The higher the GC elapsed time - the lower the application responsiveness due to the GC induced latencies 75
- 76. ©2016 CodeKaram Overhead is an indication of the frequency of stop the world GC events. The more frequent the GC events - The more likely it is to negatively impact application throughput 76
- 77. 77 What’s The #1 Contributor To A GC Elapsed Time?
- 79. 79 What Are The ContributorS To GC Overhead?
- 80. 80 Allocation Rate and Promotion Rate
- 81. ©2016 CodeKaram • Size generations keeping your application’s object longevity and size in mind. • The faster the generation gets “filled”; the sooner a GC is triggered. • Size your generations and age your objects appropriately. • The higher the amount of live data to be copied, the longer the GC pause. • Premature promotions are a big problem! 81 Tuning Recommendations
- 82. ©2016 CodeKaram Plot Allocation & Promotion Rates 82
- 83. ©2016 CodeKaram83 Young Occupancy before GC Young Gen Size Old Gen Occupancy after GC Heap Occupancy before GC Heap Occupancy after GC Heap Size Timestamps
- 84. 84 Time Check!!
- 85. 85 What About Garbage First GC?
- 86. ©2016 CodeKaram Traditional Java Heap 86 Contiguous Java Heap Eden S0 S1 Old Generation
- 87. ©2016 CodeKaram Heap Regions 87 Contiguous Java Heap Free Region Non-Free Region
- 88. ©2016 CodeKaram The Garbage First Collector - Regionalized Heap Eden Old Old Eden Old Survivor Humongous 88
- 89. ©2016 CodeKaram The Garbage First Collector Eden Old Old Eden Old Surv ivor E.g.: Current heap configuration - 89
- 90. ©2016 CodeKaram The Garbage First Collector Eden Old Old Eden Old Surv ivor E.g.: During a young collection - 90
- 91. ©2016 CodeKaram The Garbage First Collector Old Old Old E.g.: After a young collection - Sur viv or Ol d 91
- 92. ©2016 CodeKaram Old Old Old Sur viv or Ol d Eden Eden Old The Garbage First Collector 92 E.g.: Current heap configuration -
- 93. ©2016 CodeKaram Old Old Old E.g.: Reclamation of a garbage-filled region during the cleanup phase - Sur viv or Ol d Eden Eden Old The Garbage First Collector 93
- 94. ©2016 CodeKaram Old Old Old E.g.: Reclamation of a garbage-filled region during the cleanup phase - Sur viv or Ol d Eden Eden The Garbage First Collector 94
- 95. ©2016 CodeKaram Old Old Old E.g.: Current heap configuration - Sur viv or Ol d Eden Eden The Garbage First Collector 95
- 96. ©2016 CodeKaram Old Old Old E.g.: During a mixed collection - Sur viv or Ol d Eden Eden The Garbage First Collector 96
- 97. ©2016 CodeKaram Old E.g.: After a mixed collection - O l d Sur vivo r Old The Garbage First Collector 97
- 98. ©2016 CodeKaram The Garbage First Collector - Pause Histogram 98 Pausetimeinmilliseconds 0 30 60 90 120 Timestamps 3415 3416.3 3417.2 3418.4 3419 3422 3423.4 3432.2 3433.2 3436.8 3437.6 3438.9 3440 Young Collection Initial Mark Remark Cleanup Mixed Collection Initiating Heap Occupancy Percent