Java Reference
In-Depth Information
3
4
b
1
a
2
c
e
5
6
(a)
4
3
b
1
prev
a
5
2
c
e
6
curr
(b)
Figure12.18 Example of the Deutsch-Schorr-Waite garbage collection alg-
orithm. (a) The initial multilist structure. (b) The multilist structure of (a) at
the instant when link node 5 is being processed by the garbage collection alg-
orithm. A chain of pointers stretching from variable prev to the head node of the
structure has been (temporarily) created by the garbage collection algorithm.
the left branch or the right branch of the link node being pointed to. At any given
instant we have passed down only one path from the root, and we can follow the
trail of pointers back up. As we return (equivalent to popping the recursion stack),
we set the pointer back to its original position so as to return the structure to its
original condition. This is known as the Deutsch-Schorr-Waite garbage collection
algorithm.
12.4
Further Reading
For information on LISP, see The Little LISPer by Friedman and Felleisen [FF89].
Another good LISP reference is Common LISP: The Language by Guy L. Steele
[Ste90]. For information on Emacs, which is both an excellent text editor and
a programming environment, see the GNU Emacs Manual by Richard Stallman
[Sta11b]. You can get more information about Java's garbage collection system
from The Java Programming Language by Ken Arnold and James Gosling [AG06].
For more details on sparse matrix representations, the Yale representation is de-
scribed by Eisenstat, Schultz and Sherman [ESS81]. The MATLAB sparse matrix
representation is described by Gilbert, Moler, and Schreiber [GMS91].
Search WWH ::




Custom Search