|
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 37
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Umut A. Acar , Guy E. Blelloch , Robert D. Blumofe, The data locality of work stealing, Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, p.1-12, July 09-13, 2000, Bar Harbor, Maine, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Christine H. Flood , David Detlefs , Nir Shavit , Xiaolan Zhang, Parallel garbage collection for shared memory multiprocessors, Proceedings of the JavaTM Virtual Machine Research and Technology Symposium on JavaTM Virtual Machine Research and Technology Symposium, p.21-21, April 23-24, 2001, Monterey, California
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel Spoonhower , Guy E. Blelloch , Phillip B. Gibbons , Robert Harper, Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures, Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, August 11-13, 2009, Calgary, AB, Canada
|
|
|
|
|