Browse Prior Art Database

Building a break table when the heap must be walked in the same direction as compaction is to be performed Disclosure Number: IPCOM000010941D
Original Publication Date: 2003-Feb-03
Included in the Prior Art Database: 2003-Feb-03

Publishing Venue



The literature describes the use of a break table for compaction of the Java heap. As described in the literature, the break table contains the accumulated amount of free space below an object an is used to compact the heap by moving objects to lower addresses. To gather such information efficiently it is necessary to walk the heap from low address to higher and it is quite common to be able to walk the heap in this direction only. It might seem that it is therefore only possible to build break tables for compaction downwards. In fact it is possible also to build a break table for compaction upwards, even when walking the heap from low to high, and this publication describes how to do so.