An abstract machine design for lexically scoped parallel Lisp with speculative processing
Author: 
C. K. YuenAuthors Info & Claims
Abstract
An abstract machine is designed to support the data environment requirements of BaLinda Lisp, a parallel Lisp dialect which permits speculative processing of conditional modules. Logically, the machine provides multiple stacks connected into an environment tree, with lexically visible sections pointed to by display registers. Physically, stack sections are stored as separate objects and access is established by the use of a dynamic stack recording the chain of function calls, and a set of lexical display registers pointing at visible objects. This arrangement allows parts of the environment of a function to be retained or garbage-collected as appropriate after exit. By making copies of visible ancestral stack sections, side effects of speculative parallel tasks are handled in accordance with language semantics. The architecture is generic and may be realized in a variety of forms, depending on whether BaLinda Lisp is implemented on a conventional machine, stack machine, or dataflow machine.
References
[1]
1. E I Organick, Computer System Architecture: the B6500/6700 System, Academic Press, 1973.
[2]
2. E I Organick, A Programmer's View of the Intel 432 System, McGraw-Hill, 1983.
[3]
3. G J Myers, Advances in Computer Architecture, Wiley, 1982.
[4]
4. R N Ibbett and P C Capon, "The development of the MU5 computer system", Comm. ACM, vol. 21, pp. 12-24, 1978.
[5]
5. C K Yuen and W F Wong, "BaLinda Lisp: a parallel list processing language", IEEE Int'l Conf on Tools for AI, Fairfax, Virginia, Nov. 1990, pp. 618-624.
[6]
6. M D Feng and C K Yuen, "A Transputer based parallel Lisp implementation", ACM Computer Science Conf., Kansas City, Missouri, March 1992, pp. 83-90.
[7]
7. C K Yuen, M D Feng, W F wong and, J J Yee, Lisp: Languages and Architectures, Chapman and Hall, 1992.
[8]
8. J J Yee and C K Yuen, "BIDDLE: A dataflow architecture for Lisp", Hawaii Int'l Conf on Systems Science, January 1992, Koloa, Hawaii, pp. 611-618.
[9]
9. W F Wong and C K Yuen, "SARC - a stack and register computer", Symposium on Computer Architecture & Digital Signal Processing, October 1989, Hong Kong, pp. 194-199.
[10]
10. A R Pleszkun and M J Thazhuthaveetil, "The architecture of Lisp machines", IEEE Computer, March 1987, pp. 35-44.
[11]
11. D A Moon, "Architecture of the Symbolics 3600", Int'l Symp on Computer Architecture, 1985, pp. 76-83.
[12]
12. R D Greenblatt, T F Knight, J Holloway, D A Moon and D L Weinreb, "The Lisp machine", in D R Barstow, H E Shrobe and E Sandewall, Interactive Programming Environments, McGraw-Hill, 1984, pp. 326-352.
[13]
13. D S Wise, "Design for a multiprocessing heap with on-board reference counting", in J P Jouannand, Functional Programming Languages and Computer Architecture, LNCS 201, Springer-Verlag, 1985, pp. 289-304.
[14]
14. R Y Kain, Computer Architecture: Software and Hardware, volume 1, Prentice-Hall, 1989, pp. 480-497.
Index Terms
- An abstract machine design for lexically scoped parallel Lisp with speculative processing
Recommendations
An optimizing compiler for lexically scoped LISP
SIGPLAN '82: Proceedings of the 1982 SIGPLAN symposium on Compiler constructionWe are developing an optimizing compiler for a dialect of the LISP language. The current target architecture is the S-I, a multiprocessing supercomputer designed at Lawrence Livermore National Laboratory. While LISP is usually thought of as a language ...
An optimizing compiler for lexically scoped LISP
Proceedings of the 1982 SIGPLAN symposium on Compiler constructionWe are developing an optimizing compiler for a dialect of the LISP language. The current target architecture is the S-I, a multiprocessing supercomputer designed at Lawrence Livermore National Laboratory. While LISP is usually thought of as a language ...
Compiling machine-independent parallel programs
Initial evidence is presented that explicitly parallel, machine-independent programs can automatically be translated into parallel machine code that is competitive in performance with hand-written code.The programming language used is Modula-2*, an ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Nov. 1992
86 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/141018
- Editor:
- Richard L. Wexelblat
Copyright © 1992 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1992
Published in SIGPLAN Volume 27, Issue 11
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 153Total Downloads
- Downloads (Last 12 months)21
- Downloads (Last 6 weeks)8
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in