ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Implementation of multilisp: Lisp on a multiprocessor
Full text PdfPdf (713 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents
Austin, Texas, United States
Pages: 9 - 17  
Year of Publication: 1984
ISBN:0-89791-142-3
Author
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 32,   Citation Count: 38
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800055.802017
What is a DOI?

ABSTRACT

Multilisp is an extension of Lisp (more specifically, of the Lisp dialect Scheme [15]) with additional operators and additional semantics to deal with parallel execution. It is being implemented on the 32-processor Concert multiprocessor. The current implementation is complete enough to run the Multilisp compiler itself, and has been run on Concert prototypes including up to four processors. Novel techniques are used for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy: the garbage collector uses a multiprocessor algorithm modeled after the incremental garbage collector of Baker [2]. A companion paper [9] discusses language design issues relating to Multilisp.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
Cohen, S., R. Rosner, and A. Zidon, "Paralisp Simulator (reference manual)," Hebrew University Computer Science Dept. Research Report 83-2, Jerusalem, Israel, Jan. 1983.
 
5
Dijkstra, E., et al., "On-the-fly Garbage Collection: An Exercise in Co-operation," Language Hierarchies and Interfaces (Lecture Notes in Computer Science 46), Springer-Verlag, 1976.
 
6
Friedman, D., and D. Wise, "Aspects of Applicative Programming for Parallel Processing," IEEE Trans. Comp. C-27:4, April 1978, pp. 289-296.
 
7
Halstead, R., "Architecture of a Myriaprocessor," IEEE COMPCON Spring 81, San Francisco, Feb. 1981, pp. 299-302.
 
8
Halstead, R., "Architecture of a Myriaprocessor," in Advanced Computer Concepts, J. Solinsky, ed., La Jolla Institute, La Jolla, California, 1981.
 
9
Halstead, R., "The Multilisp Language: Lisp for a Multiprocessor," submitted to International Conference on Fifth Generation Computer Systems, Tokyo, Nov. 1984.
 
10
Keller, R., "Rediflow Multiprocessing," IEEE COMPCON Spring 84, San Francisco, Feb. 1984.
 
11
 
12
13
 
14
Sugimoto, S., et al., "A Multi-Microprocessor System for Concurrent Lisp," Proc. 1983 International Conf. on Parallel Processing, June 1983.
 
15

CITED BY  38

Collaborative Colleagues:
Robert H. Halstead, Jr.: colleagues