Nicholas Carriero
Abstract
How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.
- 1 Agerwa}, T., and Ar'~ind, Data flow systems. Computer 15, 2 (Feb. 1982), 10-14.Google Scholar
- 2 Agha, G. ACTORS: ,4 model of concurrent computation in distributed systems. The MIT Pr ~ss 1986. Google ScholarDigital Library
- 3 Ahuja, S., et al. Mat,:hing language and hardware for parallel computation in the Lind a machine. IEEE Trans. Computers 37, 8 (Aug, 1988}, 921-929. Google ScholarDigital Library
- 4 Ahuja, S., Carriero, ~q., and Gelernler, D. Linda and friends. IEEE Computer 19, 8 (Aug. 1986), 26-34. Google ScholarDigital Library
- 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).Google Scholar
- 6 Brinch Hansen, P. TZle programming language Concurrent Pascal. IEEE Trans. Softw. Eng., SE-1, 2 (1975}, pp. 99-206.Google Scholar
- 7 Borrman, L., and He 'dieckerhoff, M. Linda integriert in Modula-2-- ein Sparchkonzept fiir portable parallel Software. In Proceedings 10. GI/ITG-Fachtagung z trchitektur und Betrieb von Rechensystemen. (Paderborn, March 1988). Google ScholarDigital Library
- 8 Black, A., et al. Obje :t structure in the Emerald system. In Proceedings of the ACM Conf:rence on Object-Oriented Programming Systems, Languages and Applications (Portland, Ore., Sept. 29-Oct. 2, 1986), pp. 78-86. Google ScholarDigital Library
- 9 Birrel, A.D., and Nel.;on, B.J. Implementing remote procedure calls. ACM Trans. Comput. Syst. 2, 1 (Feb. 1984), pp. 39-59. Google ScholarDigital Library
- 10 Carriero, N., and Gel ernter, D. The S/Net's Linda kernel. ACM Trans. Comput. Syst. ;':, 2 IMay 1986), pp. 110-129. Google ScholarDigital Library
- 11 Carriero, N., and Ge}ernter, D. Applications experience with Linda. In Proceedings of the ,~CM Symposium on Parallel Programming, July 1988. Google ScholarDigital Library
- 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).Google Scholar
- 13 Carriero, N., Gelernt,,~r, D., and Leichter, J. Distributed data structures in Linda. In Pr( ceedings of the ACM Symposium on Principles of Programming Languages (St. Petersburg, Fla., Jan. 13-15, 1986). Google ScholarDigital Library
- 14 Chen, M. C. A parall ,q language and its compilation to multiprocessor architectures or ~fLS{. In Proceedings of the ACM Symposium Principles of Programming Languages (St. Petersburg, Fla., Jan. 13-15, 1986). Google ScholarDigital Library
- 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).Google Scholar
- 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).Google Scholar
- 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).Google Scholar
- 18 Gelernter, D. Genera' ive communication in Linda. ACM Trans. Prog. Lang. Syst. 7, i (1985) pp. 80-112. Google ScholarDigital Library
- 19 Galernter, D. Getting the job done. Byte 13, 12 {Nov. 1988}, 301-310. Google ScholarDigital Library
- 20 Gelernter, D. Elastic ,:omputing envelopes and their operators (Linda 3). Yale University D ~partment of Computer Science Research Report ()an. 1989).Google Scholar
- 21 Hoare, C.A.R. Monitors: An operating system structuring concept. Commun. ACM 17, 10 (Oct. 1974}, pp. 549-557. Google ScholarDigital Library
- 22 Hewitt, C. Viewing ccmtrol structures as patterns on passing messages. J. Art. Intell. 8, 3 {June 1977), 323.Google ScholarDigital Library
- 23 Ingalls, D. H. H. The :;malltalk-76 programming system design and implementation. In P'oceedings of the 1978 ACM Symposium Principles of Programming Languages, pp. 9-15. Google Scholar
- 24 }ul, E., et al. Fine-grained mobility in the Emerald system. ACM Trans. Comp. Sys. 6, 1 (Feb. 1988), pp. 109-133. Google ScholarDigital Library
- 25 Krishnaswamy, V., et al. The architecture of a Linda coprocessor. In Proceedings of the ACM Conference on Computer Architecture (1988). Google ScholarDigital Library
- 26 Lampson, B.W., and Redell, D.D. Experience with prozesses and monitors in Mesa. Commun. ACM 23, 2 (Feb. 1980}, pp. 105-117. Google ScholarDigital Library
- 27 Leler, W. PIX, the latest NEWS. In Proceedings of the COMPCON Spring '89 (San Francisco, Feb. 1989}, IEEE.Google Scholar
- 28 lviatsuoka, S., and Kawai, S. Using tuple space communication in distributed object-oriented languages. In Proceedings ~f OOPSLA '88 (San Diego, Sept. 25-30, 1988), pp. 274-284. Google ScholarDigital Library
- 29 May, M.D. Occam. ACM SIGPLAN Notice:; 18, 4 (I983), pp. 69-79. Google ScholarDigital Library
- 30 Ringwood, G.A. Parlog86 and the dining logicians. Commun. ACM 31, 1 (Jan. 1988}, pp. 10-25. Google ScholarDigital Library
- 31 Shapiro, E. ed. Concurrent Prolog collected papers. Vols 1 and 2. The lvllT Press, 1987. Google ScholarDigital Library
- 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.Google Scholar
- 33 Wirth, N. Modula: A language for modular multiprogramming. Softw. Pract. and Exp. 7 (1977) pp. 3-35.Google ScholarCross Ref
- 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).Google Scholar
- 35 Young, M. et al., The duality of memory and communication in the implementation of a multiprocessor operating system. In Proceedings of the Eleventh ACM Symposium on Operating Systems Principles (Nov. 1987), pp. 63-76. Google ScholarDigital Library
Index Terms
- Linda in context
Recommendations
Context-aware aspects
SC'06: Proceedings of the 5th international conference on Software CompositionContext-aware applications behave differently depending on the context in which they are running. Since context-specific behavior tends to crosscut base programs, it can advantageously be implemented as aspects. This leads to the notion of context-aware ...
Context Grouping Mechanism for Context Distribution in Ubiquitous Environments
OTM '08: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:Context distribution is a key aspect for successful applications within mobile and ubiquitous computing environments. In such environments, context information is acquired by several and multiple context sensors distributed over the environment. ...
Context modeling and inference system for heterogeneous context aware service
Proceedings of the 2007 conference on Human interface: Part IIContext can be utilized as an effective source of information for supporting the user system interface under the ubiquitous environments. The context awareness function forms the basis of the studies regarding the ubiquitous computing environment for ...
Reviews
Asis Kumar Goswami
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 concepts can claim to have this property and yet, although it has been around for about five years, Linda is hardly discussed in the research community. The paper under review is an attempt to remedy this situation and put Linda alongside some familiar parallel programming models. The paper first introduces Linda and discusses, with examples, some of its novel features, such as :9Bunification of process creation and data communication; encompassing coarse, medium, and fine-grained parallelism; and coordinating programs in different languages, user programs and supervisors, and programs with their future incarnations. The authors then give a list of existing experimental and commercial implementations of Linda. The focus of the paper, however, is on comparing Linda with conventional message-passing, concurrent object-oriented programming, concurrent logic programming, and functional programming systems. The comparison with message-passing systems is a surprise inclusion; it actually weakens the authors' arguments. Being a language for distributed computing, Linda has to use some form of message-passing and, at a certain level of abstraction, one would view Linda as based on some kind of asynchronous message communication mechanism. The authors could at least have used a suitable categorization of message-passing systems. The comparisons with the other three parallel programming models are adequate and interesting, particularly because these models share the same applications domains with Linda. The authors' approach to motivation by examples serves the overall purpose of the paper quite well. The paper is very pleasant reading. Otherwise, its detailed discussion of some well-worn subjects such as blocking of remote procedure calls and parallelizing compilers would have made it look a bit long-winded. I recommend this paper to anyone interested in distributed programming for artificial intelligence applications.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments