Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Coordination languages and their significance

Published: 01 February 1992 Publication History
First page of PDF

References

[1]
Arango, M., Berndt, D.~ Ca:rriero, N., Gelernter, D andGilmore, D. Adventures with network Linda. Supercomput. Rev. I0. 3 (:Oct. 1990) 42-46.
[2]
Agha, G., ACTORS) A Modet of Con~ currentCompu ration in D~'tt'ibuted S:ysterns, The MIT Press (1986):,
[3]
Anderson, B. and: Shasha, D. Persistent Linda: Linda + Transactions + Query: Processing:. In Research Directions in: High, Level Parallel Languages. D. LeMetayer, ed. :(Mont Saint,Michel: IRISA-INRIA, June 1991):Sprlnger Verlag ::(forthcoming).
[4]
Babb, R.G.: Parallel processing with large grain data flow techniques. IEEE Co:mput. 17 (1984)55.61.
[5]
Bakken, D.E: and Richard D. Schlic:hting, Tolerating Failures: in the Bag-of'Tasks Programming Paradigm. In Proc. of the 21st lnt~ Syrup. Fault-Tolerant Computing, Montreal, Canada (June 1991), 248-255.
[6]
Bisiani. R. and Forin, A. Multilanguage parallel programming on heterogeneous machines. IEEE Tram. Comp. 37, 8 (Aug. 1988) 930- 945.
[7]
Bisiani, R., Lecouat, F. and Ambriola, V. A tool to coordinate tools,: IEEE Software (Nov. 198.8) I7-25,
[8]
Carriero, N. and Gelernter, D. Linda incontext, Commun: ACM 32, 4 (Apr. 1989)~ 444-458.
[9]
Carriero, N. and Gelernter, D. HoW to Write Parallel Programs.' A First Course. M1T Press (1990).
[10]
Dally, w.J.i Object.oriented c0ncur!* rent programming in CST, in Proc. Third Conf, on Hypercube Concurrent Computers and Applications, (1988)p. 33.
[11]
Dongarra, J j., Sorenson, D.C:. and Brewer, P. Tools:and Methodology for Programming Parallel Processors, in Aspects of Computation on Asynchronous Processors,: M. Wright, Ed. (North Holland, 1988) pp. 125- 138.
[12]
Factor, M, The:Process Trellis Software Architecture for Parallel, Real.Time Monitors, Yale UniV. Dept. Comp. Sci., PhD. Dissertation (Oct. 1990)
[13]
Fertig, S, andGelernter, D, A Soft, ware Architecture for Acquiring Knowledge from Cases. In Proc. of the International Joint Conference on Artificiallnteltigence, Sidney, Australia, Aug. 1991.
[14]
Factor, M., Gelernter, D., Kolb, C., Miller; P. and Sittig, D. Real,Time Data:Fusion in the ICU: IEEECom. puter, Nov. 1991, 45-55.
[15]
Foster, I. and Taylor, S. Strand: New Concepts in Parallel Programming. Prentice,Hall (Englewood Cliffs:. NJ:, 1989),
[16]
Gehani, N:. and Roone, W.D. The Concurrent C Programming Language, Silicon Press, t989.
[17]
Gelernter, D. Multiple: tuple spaces in :Linda, in PARLE '89, E. Odjik, M. Rem and J.~C. Syre, Eds. Springer-Verlag: 1989; 20-27.
[18]
C~lernter, D. and Jagannathan, S. Programming Linguistics. MIS Press, 1990.
[19]
Halstead, R. Muttilisp: A language for concurrent symbolic computation. ACM Tram. Prog. Lang, and: Sys., Oct, 1985,
[20]
Jagannathan, S; OptimizingAnalysis for First-Class Tuple SpaceS, In Languages and: Compilers for Parallel CompUting' H. D, Gelernter, T. Gross, A. Nicolau and D. Padua, Eds. MIT Press/Pitman :Publishing, 19911 (forthcoming).
[21]
Jagannathan,S. and Philbin, J. Pre. liminary STi N G:benchmarks. NEC Institute Princeton internal Memo. randum, Dec: 1991.
[22]
Kahn, K.M. and Miller, :M:~S. Language Design and OpenSysmms, in The Ecology of :Computation. B. Hubermann, Ed., (North Holland, I988) 291:-3:114.
[23]
Kambhatla, S. and Walpole, J. Re, covery with limited replay: Faulttolerant processes in Linda; Oregon Grad. Inst. Dept. CSE TR CS/E 90. 019 (Sept. 1990),
[24]
LeMetayer, D., ed. Research Directions in: High,~el ParaUel Languages (Mont Saint,Michel: IRISA,INRIA, June 1991): Springer Verlag (forth. coming).
[25]
Malone, TiW. What is coordination theory:? MIT Center for Info, Systems Res. WorkingPaper 182 (Feb. 1988).
[26]
Ringwood, G.A. Parlog86 and the dininglogicians, Commun, ACM 31, (Jan. i988) 10-25.
[27]
Technical correspondence. Linda in context, Commun. ACM 32, 10 (Oct. 1989) 1244'1258.
[28]
Turner, D,A. Recursion Equations as a Programming Language, in Functional Programming and its Applications. J, Darlington, P. Henderson andD,A. Turner, Eds. Cambridge University Press (1982)pp. 1-28:,
[29]
Wilson, G. ed., Linda-Like Systems and Their Implementations (Edi:nburgh Parallel Computation Cert. tre, June 19191).

Cited By

View all
  • (2024)The B2Scala Tool: Integrating Bach in Scala with Security in MindElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.414.4414(58-76)Online publication date: 11-Dec-2024
  • (2024)Massively parallel computation of tropical varieties, their positive part, and tropical GrassmanniansJournal of Symbolic Computation10.1016/j.jsc.2023.102224120:COnline publication date: 1-Jan-2024
  • (2024)On the Expressiveness and Efficiency of Guarded Lists in BachJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.101017(101017)Online publication date: Sep-2024
  • Show More Cited By

Recommendations

Reviews

Mark Brimhall Wells

In this paper, the authors view their Linda parallel programming system [1] as a coordination language orthogonal to classical computational languages such as FORTRAN and C. Coordination refers to the creation (but not specification) of computational activities and the support of communication among them. The authors argue that this approach is a better way to approach parallelism than integrating computation and coordination into a single language as in concurrent logic programming or relying solely on implicit parallelism as in functional programming. They maintain that portability, generality, conceptual economy, and flexibility favor this approach. The paper is informal and generally self-contained, although I found it useful to reread the above-cited paper and the subsequent technical correspondence [2]. The arguments are forceful but not overwhelming. I am particularly in tune with the defense of explicit parallelism. More generally, however, I believe that mechanisms already exist in most modern object-based languages that can allow the integration of coordination with computation and still preserve conceptual and practical orthogonality and their advantages. In any event, readers will find the paper thought-provoking, and most will agree with the authors that this is a fertile research area.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 35, Issue 2
Feb. 1992
124 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/129630
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1992
Published in CACM Volume 35, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Linda
  2. coordination languages

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)228
  • Downloads (Last 6 weeks)18
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)The B2Scala Tool: Integrating Bach in Scala with Security in MindElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.414.4414(58-76)Online publication date: 11-Dec-2024
  • (2024)Massively parallel computation of tropical varieties, their positive part, and tropical GrassmanniansJournal of Symbolic Computation10.1016/j.jsc.2023.102224120:COnline publication date: 1-Jan-2024
  • (2024)On the Expressiveness and Efficiency of Guarded Lists in BachJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.101017(101017)Online publication date: Sep-2024
  • (2024)pfd-parallel, a Singular/GPI-Space package for massively parallel multivariate partial fractioningComputer Physics Communications10.1016/j.cpc.2023.108942294(108942)Online publication date: Jan-2024
  • (2024)Massively Parallel Methods for Free ResolutionsMathematical Software – ICMS 202410.1007/978-3-031-64529-7_14(127-134)Online publication date: 22-Jul-2024
  • (2023)Fault-tolerance at your Finger Tips with the TeamPlay Coordination LanguageProceedings of the 35th Symposium on Implementation and Application of Functional Languages10.1145/3652561.3652571(1-13)Online publication date: 29-Aug-2023
  • (2023)A Formal MDE Framework for Inter-DSL CollaborationCoordination Models and Languages10.1007/978-3-031-35361-1_13(232-249)Online publication date: 15-Jun-2023
  • (2023)From Procedures, Objects, Actors, Components, Services, to AgentsThe French School of Programming10.1007/978-3-031-34518-0_6(125-146)Online publication date: 11-Oct-2023
  • (2021)Anemone: A workbench for the Multi-Bach coordination languageScience of Computer Programming10.1016/j.scico.2020.102579202(102579)Online publication date: Feb-2021
  • (2021)Towards Massively Parallel Computations in Algebraic GeometryFoundations of Computational Mathematics10.1007/s10208-020-09464-x21:3(767-806)Online publication date: 1-Jun-2021
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media