Advertisement

From weaving threads to untangling the web: A view of coordination from Linda's perspective

  • Robert Bjornson
  • Nicholas Carriero
  • David Gelernter
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)

Abstract

A decade of work with the Linda coordination model in both academic and commercial settings has made clear that the need for coordination arises in a broad range of application domains, from parallel computing to information management. We review how the Linda model has evolved and is evolving to meet the particular demands of these different domains. We conclude by noting that despite this evolution, the underlying conceptual framework has remained unchanged, offering evidence for the existence of a unified approach to the challenges of coordination.

Keywords

Parallel Programming Message Passing Parallel Section Coordination Model Tuple Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Ahmed and D. Gelernter. A CASE environment for parallel programming. In Proc. Fifth International Workshop on Computer-Aided Software Engineering, July 1992.Google Scholar
  2. 2.
    R. Bjornson. Linda on Distributed-Memory Multiprocessors. PhD thesis, Yale University Department of Computer Science, New Haven, Connecticut, 1992. Department of Computer Science, RR-931.Google Scholar
  3. 3.
    N. Carriero, E. Freeman, D. Gelernter, and D. Kaminsky. Adaptive parallelism and Piranha. IEEE Computer, 28(4), Jan. 1995.Google Scholar
  4. 4.
    N. Carriero and D. Gelernter.A foundation for advanced compile-time analysis of Linda programs. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, number 589 in Lecture Notes in Computer Science. Springer Verlag, Berlin, 1992.Google Scholar
  5. 5.
    N. J. Carriero. An implementation of Linda for a NUMA machine, 1997. Submitted.Google Scholar
  6. 6.
    N. J. Carriero, D. H. Gelernter, T. G. Mattson, and A. H. Sherman. The Linda alternative to message-passing systems. Parallel Computing, 20:633–655, Apr. 1994.CrossRefGoogle Scholar
  7. 7.
    P. Ciancarini and D. Rossi. Jada: Coordination and Communication for Java agents. In J. Vitek and C. Tschudin, editors, Mobile Object Systems: Towards the Programmable Internet, volume 1222, pages 213–228. 1997.Google Scholar
  8. 8.
    M. Factor. The Process Trellis Software Architecture for Parallel, Real-Time Monitors. PhD thesis, Yale University Department of Computer Science, 1990.Google Scholar
  9. 9.
    A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine. A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994. ISBN 0-262-57108-0.Google Scholar
  10. 10.
    W. Gropp, E. Lusk, and A. Skjellum. Using MPI. MIT Press, 1994. ISBN 0-26257104-8.Google Scholar
  11. 11.
    S. Hupfer. Turingware: An Integrated Approach to Collaborative Computing. PhD thesis, Yale University Department of Computer Science, New Haven, Connecticut, 1996.Google Scholar
  12. 12.
    JavaSoft. http://chatsubo.javasoft.com/ arnold/jse_overview/jse_overview.fm22.html.Google Scholar
  13. 13.
    Scientific Computing Associates, New Haven, CT. Paradise: User's Guide and Reference Manual, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Robert Bjornson
    • 1
    • 2
  • Nicholas Carriero
    • 1
    • 2
  • David Gelernter
    • 1
    • 2
  1. 1.Department of Computer ScienceYale UniversityNew HavenUSA
  2. 2.Scientific Computing Associates, Inc.New Haven CTUSA

Personalised recommendations