version 1.1, 2002/07/24 08:00:16 |
version 1.2, 2003/06/24 05:11:38 |
|
|
<HTML> |
<HTML> |
<HEAD> |
<HEAD> |
<TITLE> Two-Level Tree Structure for Fast Pointer Lookup</TITLE> |
<TITLE> Two-Level Tree Structure for Fast Pointer Lookup</TITLE> |
<AUTHOR> Hans-J. Boehm, Silicon Graphics</author> |
<AUTHOR> Hans-J. Boehm, Silicon Graphics (now at HP)</author> |
</HEAD> |
</HEAD> |
<BODY> |
<BODY> |
<H1>Two-Level Tree Structure for Fast Pointer Lookup</h1> |
<H1>Two-Level Tree Structure for Fast Pointer Lookup</h1> |
<P> |
<P> |
The conservative garbage collector described |
The conservative garbage collector described |
<A HREF="gc.html">here</a> uses a 2-level tree |
<A HREF="http://www.hpl.hp.com/personal/Hans_Boehm/gc/">here</a> |
|
uses a 2-level tree |
data structure to aid in fast pointer identification. |
data structure to aid in fast pointer identification. |
This data structure is described in a bit more detail here, since |
This data structure is described in a bit more detail here, since |
<OL> |
<OL> |