20 Java Stand-alone Applications on z/OS Volume II
Heap
An STW collection initially performs a minimal sweep operation that searches for
and finds a free entry large enough to satisfy the current allocation failure. The
remaining unprocessed portion of the heap and mark map are left to concurrent
sweep to be both analyzed and connected. This work is accomplished by Java
threads through the allocation process. For a successful allocation, an amount of
heap relative to the size of the allocation is analyzed, and is performed outside
the allocation lock. Within an allocation, if the current free list cannot satisfy the
request, sections of analyzed heap are found and connected into the free list. If
sections exist but are not analyzed, the allocating ...