ACM Home Page
Please provide us with feedback. Feedback
Linda in context
Full text PdfPdf (1.66 MB)
Source
Communications of the ACM archive
Volume 32 ,  Issue 4  (April 1989) table of contents
Pages: 444 - 458  
Year of Publication: 1989
ISSN:0001-0782
Authors
Nicholas Carriero  Yale Univ., New Haven, CT
David Gelernter  Yale Univ., New Haven, CT
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 152,   Citation Count: 235
Additional Information:

abstract   references   cited by   index terms   review   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/63334.63337
What is a DOI?

ABSTRACT

How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.


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
Agerwa}, T., and Ar'~ind, Data flow systems. Computer 15, 2 (Feb. 1982), 10-14.
 
2
 
3
 
4
 
5
Ashcraft, C., Carrier ~, N., and Gelernter, D. Hybrid DB search and sparse LDLT factoriz ation using Linda. Yale University Department of Computer Science Research Report (Jan. 1989).
 
6
Brinch Hansen, P. TZle programming language Concurrent Pascal. IEEE Trans. Softw. Eng., SE-1, 2 (1975}, pp. 99-206.
 
7
8
9
10
11
 
12
Carriero, N., and Gel ernter, D. How to write parallel programs: A guide to the perplex~,d. Yale University Department of Computer Science Research Re 3ort 628 (Nov. 1988).
13
14
 
15
Chen, M. C., et al. Tl.e influence of machine architecture on programming style and })erformance. In Proceedings of the Third Conference on Hypercube Co tcurrent Computers and Applications (Pasadena, Calif., Jan. 19-20, 19t 8).
 
16
Factor, M., and Gele~nter, D. The parallel process lattice as an organizing scheme for re~dtime knowledge daemons. Yale University Department of Compater Science Technical Memo (March 1988).
 
17
Gelernter, D. A note )n systems programming in Concurrent Prolog. In Proceedings of the International Symposium on Logic Programming (Atlantic City, N.J., F~b. 6-9, 1984).
18
19
 
20
Gelernter, D. Elastic ,:omputing envelopes and their operators (Linda 3). Yale University D ~partment of Computer Science Research Report ()an. 1989).
21
 
22
Hewitt, C. Viewing ccmtrol structures as patterns on passing messages. J. Art. Intell. 8, 3 {June 1977), 323.
23
24
25
26
 
27
Leler, W. PIX, the latest NEWS. In Proceedings of the COMPCON Spring '89 (San Francisco, Feb. 1989}, IEEE.
28
29
30
 
31
 
32
Turner, D.A. Recursion equations as a programming language. In Functional Programming and its Applications, J. Darlington, P. Henderson and D.A. Turner, eds., Cambridge University Press 0982) pp. -28.
 
33
Wirth, N. Modula: A language for modular multiprogramming. Softw. Pract. and Exp. 7 (1977) pp. 3-35.
 
34
Whiteside, R.A., and Leichter, J.S. Using Linda for supercomputing on a local area network. Yale University Department ,:ff Computer Science Technical Memo (March 1988).
35

CITED BY  236


REVIEW

"Asis Kumar Goswami : Reviewer"

Linda is a model of process creation and coordination. It is independent of the computation of the processes and, therefore, can easily be embedded in a variety of base languages such as C, LISP, and FORTRAN. Not many parallel programming concep  more...

Collaborative Colleagues:
Nicholas Carriero: colleagues
David Gelernter: colleagues