Abstract
We present here a data parallel dialect of lisp, Plural EuLisp, which is a relatively low-level abstract model of massively parallel processing. It is not as rich as languages like Connection Machine Lisp and Paralation Lisp but encompasses ideas integral to at least Paralation Lisp. However its low-level nature makes the explanation of the underlying processor/memory management mechanisms easier as the low level structures are closer to the objects in Plural EuLisp. We describe how memory and processors are allocated and garbage collected, with particular interest in heterogeneous data parallel objects — which in general have been considered too expensive to be supported seriously.
This work has been partially supported through the British Council ARC Programme, a Science and Engineering Research Council (SERC) Studentship, SERC grant GR/G31048, International Computers Limited (SERC CASE award)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bale, A. Implementing Lisp on the ICL Distributed Array Processor. Queen Mary College, Dept. of Computer Science, 1986.
Blelloch, G. E. and Sabot, G. W. Compiling Collection-Oriented languages onto Massively Parallel Computers, volume 8, pages 119–134. Journal of Parallel and Distributed Computing, 1990.
Lang et al. Gargbage Collecting the World. ACM Symposium on Principles of Programming Languages, New York, 1992.
Evett, M. and Hendler, J. Achieving Computationally Effective Knowledge Representation via Massively Parallel Lisp Implementation. Europal Workshop for High Performance and Parallel Computing in Lisp, Nov 1990.
Fitch, J. P. and Norman, A. C. A Note on Compacting Garbage Collection, volume 10, pages 31–34. The Computer Journal, July 1976.
Haddon, B. K. and Waite, Q. M. A Compacting Procedure for variable-length storage elements, volume 10, page 162. The Computer Journal, 1967.
Hillis, W. D. The Connection Machine. MIT Press, Cambridge, MA, 1985.
Padget, J. A. and Nuyens, G. The EuLisp Definition. to be published by the Commission of the European Communities, 1992.
Sabot, G. W. Paralation Lisp Reference Manual. Thinking Machines Corp., 1988. Tech. Report PL87-11.
Sabot, G. W. The Paralation Model: Architecture Independent SIMD Programming. MIT Press, Cambridge, MA, 1988.
Steele, G. L., Jr., and Hillis, W. D. Connection Machine Lisp: Fine-Grained Parallel Symbolic Processing, pages 279–297. ACM Conference on Lisp and Functional Programming, 1986.
Steele, G. L., Jr., and Wholey, S. Connection Machine Lisp: A Dialect of Common Lisp for Data Parallel Programming. International Conference on Super Computing, 1987. TMC Tech. Report PL87-6.
Thinking Machines Corporation. *Lisp Reference Manual, 1988.
Tomboulian, S. and Pappas, M. Indirect Addressing and Load Balancing for Faster Solution to Mandelbrot Set on SIMD architectures. MasPar Corporation Tech. Report, October 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merrall, S.C., Padget, J.A. (1992). Collections and garbage collection. 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/BFb0017208
Download citation
DOI: https://doi.org/10.1007/BFb0017208
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