Vectorized garbage collection

@article{Appel1989VectorizedGC,
  title={Vectorized garbage collection},
  author={Andrew W. Appel and Aage Bendiksen},
  journal={The Journal of Supercomputing},
  year={1989},
  volume={3},
  pages={151-160}
}
Garbage collection can be done in vector mode on supercomputers like the CRAY-2 and the Cyber 205. Both copying collection and mark-and-sweep can be expressed as breadth-first searches in which the “queue” can be processed in parallel. We have designed a copying garbage collector whose inner loop works entirely in vector mode. We give performance measurements of the algorithm as implemented for Lisp CONS cells on the Cyber 205. Vector-mode garbage collection performs up to nine times faster… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Neun, ‘‘The implementation and optimization of Portable Standard Lisp for the Cray,’

Wayne Anderson, William Galway, Robert Kessler, Herbert Melenk, Winfried
Proc. 20th Annual Hawaii Int’l Conf. on Science Systems, • 1987
View 4 Excerpts
Highly Influenced

A Nonrecursive List Compacting Algorithm

Commun. ACM • 1970
View 6 Excerpts
Highly Influenced

Parallel processing using depth-first and breadth-first search,’

D. M. Eckstein
Ph.D. thesis, • 1977
View 1 Excerpt

Similar Papers

Loading similar papers…