Skip to main content

Comparing Software Architectures for Coordination Languages

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1594))

Abstract

We discuss three software architectures for coordination. All architectures are based on agents. Each agent has a local dataspace that contains shared distributed replicated data. The three architectures differ in the way agents communicate: either through an unordered broadcast, through an atomic broadcast, or through a synchronization among all agents. We first show how to represent both data-driven and control-oriented coordination languages in our model. Then we compare the behavior of the three architectures, under the assumption that the local dataspaces are either sets or multisets.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication. In Proc. of TAPSOFT’93, volume 668 of LNCS, pages 182–198, Springer, 1993.

    Google Scholar 

  2. J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3+4):445–473, 1991.

    Article  Google Scholar 

  3. F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutellá, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. To appear in Theoretical Computer Science, 1999.

    Google Scholar 

  4. F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5(1):23–70, 1993.

    Article  Google Scholar 

  5. M. Boasson. Control systems software. In IEEE Transactions on Automatic Control 38:7, pages 1094–1107, 1993.

    Article  MathSciNet  Google Scholar 

  6. M.M. Bonsangue, J.N. Kok, M. Boasson, and E. de Jong. A software architecture for distributed control systems and its transition system semantics. In Proc. of ACM Symp. on Applied Computing (SAC’98), pages 159–168. ACM press, 1998.

    Google Scholar 

  7. M.M. Bonsangue, J.N. Kok, and G. Zavattaro. Comparing coordination models based on shared distributed replicated data. In Proc. of ACM Symp. on Applied Computing (SAC’99). ACM press, 1999.

    Google Scholar 

  8. A. Brogi and J.-M. Jacquet. On the expressiveness of Linda-like concurrent languages In I. Castellani and C. Palamidessi editors, Proc. of Express’98, volume 16(2) of Electronic Notes in Theoretical Computer Science, 1998.

    Google Scholar 

  9. N. Busi, R. Gorrieri, and G. Zavattaro. Comparing Three Semantics for Linda-like Languages. To appear in Theoretical Computer Science, 1999.

    Google Scholar 

  10. N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. To appear in Information and Computation, 1999.

    Google Scholar 

  11. N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. In Theoretical Computer Science, 192(2): 167–199, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Carriero and D. Gelernter. Linda in context. In Communications of the ACM 32:4, pages 444-458, 1989.

    Article  Google Scholar 

  13. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications, and Relationship to other models of Concurrency, volume 255 of LNCS, pages 279–324, Springer-Verlag, 1987.

    Google Scholar 

  14. D.E. Perry and A. L. Wolf. Foundations for the Study of Software Architecture. In Software Engineering Notes, ACM SIGSOFT vol. 17:4, pages 40–52, 1992.

    Article  Google Scholar 

  15. G. Zavattaro. Towards a Hierarchy for Negative Test Operators for Generative Communication. In I. Castellani and C. Palamidessi editors, Proc. of Express’98, volume 16(2) of Electronic Notes in Theoretical Computer Science, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonsangue, M.M., Kok, J.N., Zavattaro, G. (1999). Comparing Software Architectures for Coordination Languages. In: Ciancarini, P., Wolf, A.L. (eds) Coordinatio Languages and Models. COORDINATION 1999. Lecture Notes in Computer Science, vol 1594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48919-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48919-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65836-8

  • Online ISBN: 978-3-540-48919-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics