Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. A. M. Ali. Incremental garbage collection for or-parallel Prolog based on WAM. Gigalips Workshop, April 20–21, 1989.
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.
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.
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.
M. Dorochevsky. Garbage collection in the or-parallel logic programming system Elip-Sys. ECRC, Technical Report DPS-85, 1991.
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.
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.
F. L. Morris. A time-and space-efficient garbage compaction algorithm. Communications of the ACM, 21(8):662–665, 1978.
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.
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.
D. H, D. Warren. An abstract Prolog instruction set. Technical report, SRI International, Artificial Intelligence Center, August 1983.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weemeeuw, P., Demoen, B. (1992). Garbage collection in Aurora: An overview. In: Bekkers, Y., Cohen, J. (eds) Memory Management. IWMM 1992. Lecture Notes in Computer Science, vol 637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017207
Download citation
DOI: https://doi.org/10.1007/BFb0017207
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55940-5
Online ISBN: 978-3-540-47315-2
eBook Packages: Springer Book Archive