Garbage collection in Aurora: An overview

  • Patrick Weemeeuw
  • Bart Demoen
Parallelism II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 637)


Aurora is an OR-parallel Prolog system whose implementation is based on the WAM, an efficient sequential implementation model. This paper discusses several issues related to parallel Garbage Collection (GC) in Aurora. The GC itself is a generalization of GC techniques used for sequential Prolog.

In order to make this paper self-contained, we focus on the general principles. More specifically, many optimizations are not discussed, insofar they are not directly related to the GC process.


Search Tree Garbage Collection Prolog Program Garbage Collector Compaction Phase 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. A. M. Ali. Incremental garbage collection for or-parallel Prolog based on WAM. Gigalips Workshop, April 20–21, 1989.Google Scholar
  2. 2.
    K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719–741, June 1988.CrossRefGoogle Scholar
  3. 3.
    A. Beaumont, S. Muthu Raman, P. Szeredi, and D. H. D. Warren. Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler. In PARLE91: Conference on Parallel Architectures and Languages Europe. Springer-Verlag, June 1991.Google Scholar
  4. 4.
    R. Butler, T. Disz, E. Lusk, R. Olson, R. Overbeek, and R. Stevens. Scheduling orparallelism: an Argonne perspective. In K. A. Bowen, editor, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1590–1605. MIT Press, 1988.Google Scholar
  5. 5.
    M. Dorochevsky. Garbage collection in the or-parallel logic programming system Elip-Sys. ECRC, Technical Report DPS-85, 1991.Google Scholar
  6. 6.
    M. Dorochevsky, K. Schuerman, A. Véron, and J. Xu. Constraint handling, garbage collection and execution model issues in ElipSys. In A. Beaumont and G. Gupta, editors, Parallel Execution of Logic Programs, Proceedings of the ICLP'91 Pre-Conference Workshop, Lecture Notes in Computer Science 569, pages 17–28, June 1991.Google Scholar
  7. 7.
    E. Lusk, E. R. Butler, T. Diss, R. Olson, R. Overbeek, R. Stevens, D. H. D. Warren, A. Calderwood, P. Szeredi, S. Haridi, P. Brand, M. Carlsson, A. Ciepielewski, and B. Hausman. The Aurora or-parallel Prolog system. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 819–830, 1988.Google Scholar
  8. 8.
    F. L. Morris. A time-and space-efficient garbage compaction algorithm. Communications of the ACM, 21(8):662–665, 1978.CrossRefGoogle Scholar
  9. 9.
    E. Pittomvils, M. Bruynooghe, and Y. Willems. Towards a real time garbage collector for Prolog. In Proceedings of the Second Symposium on Logic Programming, 19S5.Google Scholar
  10. 10.
    P. Szeredi and M. Carlsson. The engine-scheduler interface in the Aurora or-parallel Prolog system. Technical report, University of Bristol, Computer Science Department, April 1990. TR 90-09.Google Scholar
  11. 11.
    D. H, D. Warren. An abstract Prolog instruction set. Technical report, SRI International, Artificial Intelligence Center, August 1983.Google Scholar
  12. 12.
    D. H. D. Warren. Or-parallel execution models of Prolog. In Proceedings of the International Joint Conference on Theory and Practice of Software Development, pages 243–259, 1987.Google Scholar
  13. 13.
    D. H. D. Warren. The SRI model for or parallel execution of Prolog — abstract design and implementation. In Proceedings of the Symposium on Logic Programming, pages 92–102, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Patrick Weemeeuw
    • 1
  • Bart Demoen
    • 1
  1. 1.Dept. of Computer ScienceK. U. LeuvenLeuven

Personalised recommendations