===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/gc/doc/tree.html,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -p -r1.1 -r1.2
--- OpenXM_contrib2/asir2000/gc/doc/tree.html 2002/07/24 08:00:16 1.1
+++ OpenXM_contrib2/asir2000/gc/doc/tree.html 2003/06/24 05:11:38 1.2
@@ -1,13 +1,14 @@
Two-Level Tree Structure for Fast Pointer Lookup
- Hans-J. Boehm, Silicon Graphics
+ Hans-J. Boehm, Silicon Graphics (now at HP)
Two-Level Tree Structure for Fast Pointer Lookup
The conservative garbage collector described
-here uses a 2-level tree
+here
+uses a 2-level tree
data structure to aid in fast pointer identification.
This data structure is described in a bit more detail here, since