Table of Contents
[ iii ]
Write barriers 88
Throughput versus low latency 90
Optimizing for throughput 91
Optimizing for low latency 91
Garbage collection in JRockit 92
Old collections 93
Nursery collections 93
Permanent generations 94
Compaction 95
Speeding it up and making it scale 95
Thread local allocation 96
Larger heaps 97
32-Bits and the 4-GB Barrier 97
The 64-bit world 98
Cache friendliness 100
Prefetching 101
Data placement 102
NUMA 102
Large pages 104
Adaptability 105
Near-real-time garbage collection 107
Hard and soft real-time 107
JRockit Real Time 108
Does the soft real-time approach work? 109
How does it work? 111
The Java memory API 112
Finalizers 112
References 113
Weak references 113
Soft references 114
Phantom references 114
Differences in JVM behavior 116
Pitfalls and false optimizations 116
Java is not C++ 117
Controlling JRockit memory
management 117
Basic switches 118
Outputting GC data 118
Set initial and maximum heap size 119
Controlling what to optimize for 119
Specifying a garbage collection strategy 120
Compressed references 120
Advanced switches 121
Summary 121
剩余587页未读，继续阅读
