|
ABSTRACT
Multilisp is a parallel programming language derived from the Scheme dialect of Lisp by addition of the future construct. Multilisp has been implemented on Concert, a shared-memory muitiprocessor that uses a novel RingBus interconnection. Concert currently has 28 MC68000 processors, with a design goal of 32 processors. Several application programs have been developed and measured using Concert Multilisp. Experience with these programs has contributed to tuning the Multilisp language design and will ultimately contribute to the design of a parallel architecture streamlined for high performance on Multilisp programs.
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
|
3. Arvind, K. Gostelow, and W. Plouffe, An Asynchronous Programming Language and Computing Machine, U.C. Irvine Report TR114a, 1978.
|
| |
4
|
4. Back, H. J., Parallel Retrieval Algorithms for Semantic Nets, S.B. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., June 1986.
|
| |
5
|
|
| |
6
|
6. Bradley, E., Logic Simulation on a Multiprocessor, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., June 1986.
|
| |
7
|
7. Courtemanche, A., MultiTrash, a Parallel Garbage Collector for MultiScheme, S.B. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., Jan. 1986.
|
| |
8
|
8. Dennis, J. B., "Data Flow Supercomputers," IEEE Computer 13:11, Nov. 1980, pp. 48-56.
|
| |
9
|
|
| |
10
|
10. Gray, S., Using Futures to Exploit Parallelism in Lisp, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., Jan. 1986.
|
 |
11
|
|
 |
12
|
|
| |
13
|
13. Halstead, R., and J. Loaiza, "Exception Handling in Multilisp," 1985 Int'l. Conf. on Parallel Processing, St. Charles, III., Aug. 1985, pp. 822-830.
|
 |
14
|
R. R. Halstead, Jr. , T. L. Anderson , R. B. Osborne , T. L. Sterling, Concert: design of a multiprocessor development system, Proceedings of the 13th annual international symposium on Computer architecture, p.40-48, June 02-05, 1986, Tokyo, Japan
|
| |
15
|
|
 |
16
|
|
| |
17
|
17. Katz, M., ParaTran: A Transparent, Transaction Based Runtime Mechanism for Parallel Execution of Scheme, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., May 1986.
|
| |
18
|
18. Keller, R., and F. Lin, "Simulated Performance of a Reduction-Based Multiprocessor," IEEE Computer 17:7, July 1984, pp. 70-82.
|
 |
19
|
|
| |
20
|
20. Knueven, P., P. Hibbard, and B. Leverett, "A Language System for a Multiprocessor Environment," Fourth International Conf. on the Design and Implementation of Algorithmic Languages, Courant Institute of Mathematical Studies, New York, June 1976, pp. 264-274.
|
| |
21
|
|
| |
22
|
22. Lau, W., Lexical Analysis of Noisy Phonetic Transcriptions, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., Feb. 1986.
|
| |
23
|
23. Ma, M., Efficient Message-Based System for Concurrent Simulation, Ph.D. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., in preparation.
|
| |
24
|
24. Miller, J., MultiScheme: A Parallel Processing System Based on MIT Scheme, Ph.D. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., in preparation.
|
| |
25
|
25. Nuth, P., A Processor for Multilisp, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., in preparation.
|
| |
26
|
26. Osborne, R., Modeling the Performance of the Concert Multiprocessor, S.M. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., June 1986.
|
| |
27
|
27. Solomon, S., A Query Language on a Parallel Machine Operating System, S.B. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., May 1985.
|
| |
28
|
28. Turner, D., "A New Implementation Technique for Applicative Languages," Software -- Practice and Experience 9:1, Jan. 1979, pp. 31-49.
|
| |
29
|
29. Wang, A., Exploiting Parallelism in Lisp Programs with Side Effects, S.B. thesis, M.I.T. E.E.C.S. Dept., Cambridge, Mass., May 1986.
|
|