skip to main content
10.1145/2245276.2232017acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Dreams: a framework for distributed synchronous coordination

Published:26 March 2012Publication History

ABSTRACT

Synchronous coordination systems, such as Reo, exchange data via indivisible actions, while distributed systems are typically asynchronous and assume that messages can be delayed or get lost. To combine these seemingly contradictory notions, we introduce the Dreams framework. Coordination patterns in Dreams are described using a synchronous model based on the Reo language, whereas global system behaviour is given by the runtime composition of autonomous actors communicating asynchronously. Dreams also exploits the use of actors in the composition of synchronous coordination patterns to allow communication whenever possible, increasing the scalability of the implementation.

References

  1. G. Agha. Actors: a model of concurrent computation in distributed systems. The MIT Press, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Agha and P. Thati. An algebraic theory of actors and its application to a simple object-based language. In O. Owe, S. Krogdahl, and T. Lyche, editors, Essays in Memory of Ole-Johan Dahl, pages 26--57. LNCS 2635, 2004.Google ScholarGoogle Scholar
  3. F. Arbab. Coordination of mobile components. Electronic Notes in Theoretical Computer Science, 54: 1--16, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  4. F. Arbab. Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science, 14(3): 329--366, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Arbab, R. Bruni, D. Clarke, I. Lanese, and U. Montanari. Tiles for Reo. In A. Corradini and U. Montanari, editors, Recent Trends in Algebraic Development Techniques, pages 37--55. LNCS 5486, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Arbab, C. Koehler, Z. Maraikar, Y.-J. Moon, and J. Proença. Modeling, testing and executing Reo connectors with the Eclipse Coordination Tools. In Proceedings of FACS, 2008.Google ScholarGoogle Scholar
  7. C. Baier, M. Sirjani, F. Arbab, and J. J. M. M. Rutten. Modeling component connectors in Reo by constraint automata. Science of Computer Programming, 61(2): 75--113, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Baragatti, R. Bruni, H. Melgratti, U. Montanari, and G. Spagnolo. Prototype platforms for distributed agreements. Electronic Notes in Theoretical Computer Science, 180(2): 21--40, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. Berry. The foundations of Esterel. In G. D. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language, and Interaction, pages 425--454. The MIT Press, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. BPEL4WS. Business Process Execution Language for Web Services, May 2003.Google ScholarGoogle Scholar
  11. R. Bruni, C. Laneve, and U. Montanari. Orchestrating transactions in Join calculus. In L. Brim, P. Jancar, M. Kretínský, and A. Kucera, editors, CONCUR, pages 321--337. LNCS 2421, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. M. Chapiro. Globally-Asynchronous Locally-Synchronous Systems. PhD thesis, Standford University, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Clarke, D. Costa, and F. Arbab. Connector colouring I: Synchronisation and context dependency. Science of Computer Programming, 66(3): 205--225, May 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Clarke, J. Proença, A. Lazovik, and F. Arbab. Channel-based coordination via constraint satisfaction. Science of Computer Programming, 76, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Guerraoui and L. Rodrigues. Introduction to Reliable Distributed Programming. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Haller and M. Odersky. Scala actors: Unifying thread-based and event-based programming. Theoretical Computer Science, 410(2--3): 202--220, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Khosravi, M. Sirjani, N. Asoudeh, S. Sahebi, and H. Iravanchi. Modeling and analysis of Reo connectors using Alloy. In D. Lea and G. Zavattaro, editors, COORDINATION, volume 5052, pages 169--183. LNCS 5052, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. Koehler and D. Clarke. Decomposing port automata. In Proc. SAC '09, pages 1369--1373, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. Krause. Reconfigurable component connectors. PhD thesis, LIACS, Faculty of Mathematics and Natural Sciences, Leiden University, 2011.Google ScholarGoogle Scholar
  20. Z. Maraikar, A. Lazovik, and F. Arbab. Building mashups for the enterprise with SABRE. In A. Bouguettaya, I. Krüger, and T. Margaria, editors, ICSOC, pages 70--83. LNCS 5364, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. N. H. Minsky and V. Ungureanu. Law-governed interaction: a coordination and control mechanism for heterogeneous distributed systems. ACM Transactions on Software Engineering and Methodology, 9(3): 273--305, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Mousavi, M. Sirjani, and F. Arbab. Formal semantics and analysis of component connectors in Reo. Electronic Notes in Theoretical Computer Science, 154(1): 83--99, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Proença. Synchronous Coordination of Distributed Components. PhD thesis, LIACS, Faculty of Mathematics and Natural Sciences, Leiden University, 2011.Google ScholarGoogle Scholar
  24. W. M. P. van der Aalst, A. H. M. ter Hofstede, B. Kiepuszewski, and A. P. Barros. Workflow patterns. Distributed Parallel Databases, 14(1): 5--51, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
    March 2012
    2179 pages
    ISBN:9781450308571
    DOI:10.1145/2245276
    • Conference Chairs:
    • Sascha Ossowski,
    • Paola Lecca

    Copyright © 2012 ACM

    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: 26 March 2012

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader