Matching Language and Hardware for Parallel Computation in the Linda Machine

IEEE Transactions on Computers

Volumn 37, Issue 8, 1988, Pages 921-929

  Carriero, Nicholas J ^a   Gelernter, David H ^a   Krishnaswamy, Venkatesh ^a   Ahuja, Sudhir ^b  

^a YALE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

communication and pattern matching; Grid of buses; hardware Suppor for objects; tuple space

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES;

ASSOCIATIVE MEMORY; LINDA MACHINE; PARALLEL COMPUTATION; TUPLE SPACE;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024055866     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.2244     Document Type: Article

References (24)

1. S. Ahuja, “S/Net: A high speed interconnect for multiple computers,” IEEE J. Select. Areas Commun., pp. 751-756, Nov. 1983.
2. S. Ahuja, N. Carriero, and D. Gelernter, “Linda and friends,” IEEE Computer, pp. 110–129, May 1986.
3. S. Ahuja, N. Carriero, D. Gelernter, and V. Krishnaswamy, “Progress towards a Linda machine,” in Proc. Int. Conf. Comput. Design, Oct. 1986, pp. 97–101.
4. Arvind, K. P. Gostelow, and W. Plouffe, “An asynchronous language and computing machine,” TR114a Univ. California, Irvine, Jan. 1978.
5. H. E. Bal, R. van Renesse, and A. S. Tanenbaum, “Implementing distributed algorithms using remote procedure calls,” in Proc. 1987 Nat. Comput. Conf., June 1987, pp. 499–506.
6. R. Bjornson, N. Carriero, D. Gelernter, and J. Leichter, “Linda, the portable parallel,” Yale Univ. Dep. Comput. Sci. Tech. Rep. RR-520, Jan. 1988.
7. W. R. Bush, A. D. Samples, D. Ungar, and P. Hilfinger, “Compiling Smalltalk-80 to a RISC,” in Proc. ASPLOS II, Oct. 1987, pp. 112– 116.
8. N. Carriero, “Implementing tuple space machines,” Ph.D. dissertation, Yale Univ., New Haven, CT.
9. N. Carriero and D. Gelernter, “Applications experience in Linda,” in Proc. ACM Conf. Parallel Programming, July 1988, to be published.
10. N. Carriero and D. Gelernter, “The S/Net's Linda kernel,” ACM Trans. Comput. Syst., pp. 110–129, May 1986.
11. N. Carriero, D. Gelemter, and J. Leichter, “Distributed data structures in Linda,” in Proc. ACM Symp. Principles Programming Languages, Jan. 1986.
12. W. J. Dally et al., “Architecture of a message driven processor,” in Proc. 14th Annu. Int. Symp. Comput. Architecture, 1987, pp. 189–196.
13. A. L. Fisher, H. T. Kung, L. M. Monier, H. Walker, and Y. Dohi, “Design of the PSC: A programmable systolic chip,” in Proc. Third Caltech Conf. Very Large Scale Integration, Mar. 1983.
14. D. Gelemter, “Dynamic global name spaces on network computers,” in Proc. Int. Conf. Parallel Processing, Aug. 1984, pp. 25–31.
15. —, “Generative communication in Linda,” ACM Trans. Programming Languages Syst., pp. 80–112, Jan. 1985.
16. D. Gelemter and A. Bernstein, “Distributed communication via global buffer,” in Proc. ACM Symp. Principles Distributed Comput., Aug. 1982, pp. 10–18.
17. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, “The NYU Ultrcomputer—Designing an MIMD shared memory parallel computer,” in Proc. 9th Annu. Int. Symp. Comput. Architecture, 1982, pp. 27–42.
18. J. R. Gurd, C. C. Kirkham, and I. Watson, “The Manchester prototype dataflow computer,” Commun. ACM, vol. 28, Jan. 1985.
19. D. Hillis, “The Connection Machine, ” The ACM Distinguished Dissertation Series. Cambridge, MA: MIT Press, 1985.
20. V. Krishnaswamy, S. Ahuja, N. Carriero, and D. Gelemter, “Architecture of a Linda coprocessor,” in Proc. 15th Annu. Int. Symp. Comput. Architecture, 1988.
21. S. Lucco, “A heuristic Linda kernel for hypercube multiprocessors,” in Proc. 1986 Workshop Hypercube Multiprocessors, Sept. 1986.
22. P. Steenkiste and J. Hennessy, “Tags and type checking in LISP: Hardware and software approaches,” in Proc. ASPLOS II, Oct. 1987, pp. 50–59.
23. C. Whitby-Strevens, “The transputer,” in Proc. 12th Annu. Int. Symp. Comput. Architecture, 1985, pp. 292–300.
24. M. J. Wise, Prolog Multiprocessors. Englewood Cliffs, NJ: Prentice-Hall, to be published.