Scribd
Upload
46 views

Composition of The Young Generation: Usage Is 0 For Both Spaces, Then Take That As A Sign That Something

The young generation is divided into three spaces: one Eden space and two Survivor spaces. Newly created objects are placed in the Eden space and surviving objects are moved to the Survivor spaces after garbage collection. Objects that survive multiple garbage collections are promoted to the old generation. The Serial GC uses a single thread for garbage collection of the old generation, while the Parallel GC uses multiple threads, making it faster.

Uploaded by

Smith F. John
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views

Composition of The Young Generation: Usage Is 0 For Both Spaces, Then Take That As A Sign That Something

The young generation is divided into three spaces: one Eden space and two Survivor spaces. Newly created objects are placed in the Eden space and surviving objects are moved to the Survivor spaces after garbage collection. Objects that survive multiple garbage collections are promoted to the old generation. The Serial GC uses a single thread for garbage collection of the old generation, while the Parallel GC uses multiple threads, making it faster.

Uploaded by

Smith F. John
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Composition of the Young Generation

In order to understand GC, let's learn about the young generation,


where the objects are created for the first time. The young generation
is divided into 3 spaces.

One Eden space

Two Survivor spaces


There are 3 spaces in total, two of which are Survivor spaces. The
order of execution process of each space is as below:
1. The majority of newly created objects are located in the Eden
space.
2. After one GC in the Eden space, the surviving objects are moved
to one of the Survivor spaces.
3. After a GC in the Eden space, the objects are piled up into the
Survivor space, where other surviving objects already exist.
4. Once a Survivor space is full, surviving objects are moved to the
other Survivor space. Then, the Survivor space that is full will be
changed to a state where there is no data at all.
5. The objects that survived these steps that have been repeated
a number of times are moved to the old generation.
As you can see by checking these steps, one of the Survivor spaces
must remain empty. If data exists in both Survivor spaces, or the
usage is 0 for both spaces, then take that as a sign that something
is wrong with your system.
The process of data piling up into the old generation through minor
GCs can be shown as in the below chart:

Figure 3: Before & After a GC.


Note that in HotSpot VM, two techniques are used for faster memory
allocations. One is called "bump-the-pointer," and the other is
called "TLABs (Thread-Local Allocation Buffers)."
Bump-the-pointer technique tracks the last object allocated to the
Eden space. That object will be located on top of the Eden space. And
if there is an object created afterwards, it checks only if the size of the

object is suitable for the Eden space. If the said object seems right, it
will be placed in the Eden space, and the new object goes on top. So,
when new objects are created, only the lastly added object needs to
be checked, which allows much faster memory allocations. However,
it is a different story if we consider a multithreaded environment. To
save objects used by multiple threads in the Eden space for ThreadSafe, an inevitable lock will occur and the performance will drop due
to the lock-contention. TLABs is the solution to this problem in
HotSpot VM. This allows each thread to have a small portion of its
Eden space that corresponds to its own share. As each thread can
only access to their own TLAB, even the bump-the-pointer technique
will allow memory allocations without a lock.
This has been a quick overview of the GC in the young generation.
You do not necessarily have to remember the two techniques that I
have just mentioned. You will not go to jail for not knowing them. But
please remember that after the objects are first created in the Eden
space, and the long-surviving objects are moved to the old generation
through the Survivor space.

GC for the Old Generation


The old generation basically performs a GC when the data is full. The
execution procedure varies by the GC type, so it would be easier to
understand if you know different types of GC.
According to JDK 7, there are 5 GC types.
1. Serial GC
2. Parallel GC
3. Parallel Old GC (Parallel Compacting GC)
4. Concurrent Mark & Sweep GC (or "CMS")
5. Garbage First (G1) GC
Among these, the serial GC must not be used on an operating
server. This GC type was created when there was only one CPU core
on desktop computers. Using this serial GC will drop the application
performance significantly.
Now let's learn about each GC type.

Serial GC (-XX:+UseSerialGC)
The GC in the young generation uses the type we explained in the
previous paragraph. The GC in the old generation uses an algorithm
called "mark-sweep-compact."
1. The first step of this algorithm is to mark the surviving objects
in the old generation.
2. Then, it checks the heap from the front and leaves only the
surviving ones behind (sweep).
3. In the last step, it fills up the heap from the front with the
objects so that the objects are piled up consecutively, and
divides the heap into two parts: one with objects and one
without objects (compact).
The serial GC is suitable for a small memory and a small number of
CPU cores.

Parallel GC (-XX:+UseParallelGC)

Figure 4: Difference between the Serial GC and Parallel GC.


From the picture, you can easily see the difference between the serial
GC and parallel GC. While the serial GC uses only one thread to
process a GC, the parallel GC uses several threads to process a GC,
and therefore, faster. This GC is useful when there is enough memory
and a large number of cores. It is also called the "throughput GC."

You might also like