Coordination as a Service

• Autorzy: Viroli M. , Omicini A.
• Języki publikacji: EN

Abstrakty

EN

Coordination models like LINDA were first conceived in the context of closed systems, like high-performance parallel applications. There, all coordinated entities were known once and for all at design time, and coordination media were conceptually part of the coordinated application. Correspondingly, traditional formalisations of coordination models - where both coordinated entities and coordination media are uniformly represented as terms of a process algebra - endorse the viewpoint of coordination as a language for building concurrent systems. The complexity of today application scenarios calls for a new approach to the formalisation of coordination models. Open systems, typically hosting a multiplicity of applications working concurrently, require coordination to be imposed through powerful abstractions that (i) persist through the whole engineering process - from design to execution time - and (ii) provide coordination services to applications by a shared infrastructure in the form of coordination media. As a unifying framework for a number of existing works on the semantics of coordination media, in this paper we present a basic ontology and a formal framework endorsing the viewpoint of coordination as a service. By this framework, coordination media are characterised in terms of their interactive behaviour, and are seen as primary abstractions amenable of formal investigation, promoting their exploitation at every step of the engineering process.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2006
• Tom: Vol. 73, nr 4
• Strony: 507--534
• Opis fizyczny: bibliogr. 57 poz.

Twórcy

autor

Viroli M.

autor

Omicini A.

• DEIS, Alma Mater Studiorum - Universita di Bologna, via Venezia 52, 47023 Cesena, FC, Italy,

Bibliografia

• [1] Arabnia, H. R., Ed.: International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), CSREA Press, Las Vegas, NV, USA, 24-27 July 2002, ISBN 1-892512-89-0.
• [2] Arbab, F., Herman, I., Spilling, P.: An Overview of MANIFOLD and its Implementation, Concurrency: Practice and Experience, 5(1), February 1993, 23-70, ISSN 1040-3108.
• [3] Arbab, F., Mavaddat, F.: Coordination through Channel Composition, in: Arbab and Talcott [4], 22-39.
• [4] Arbab, F., Talcott, C., Eds.: Coordination Languages andModels, vol. 2315 of LNCS, Springer-Verlag, 2002, ISBN 3-540-43410-0.
• [5] Banatre, J.-P., Le Metayer, D.: Programming by Multiset Transformation, Communications of the ACM, 36(1), 1993, 98-111, ISSN 0001-0782.
• [6] Bergstra, J. A., Ponse, A., Smolka, S. A., Eds.: Handbook of Process Algebra, North-Holland, 2001, ISBN 0-444-82830-3.
• [7] Berry, G., Boudol, G.: The chemical abstract machine, Theoretical Computer Science, 96, 1992, 217-248, ISSN 0304-3975.
• [8] de Boer, F. S., Palamidessi, C.: Embedding as a Tool for Language Comparison, Information and Computation, 108(1), 1994, 128-157, ISSN 0890-5401.
• [9] Bonsangue, M. M., Arbab, F., de Bakker, J. W., Rutten, J. J. M. M., Scutella, A., Zavattaro, G.: A transition system semantics for the control-driven coordination languageMANIFOLD, Theoretical Computer Science, 240(1), June 2000, 3-47, ISSN 0304-3975.
• [10] Brogi, A., Ciancarini, P.: The Concurrent Language Shared Prolog, Transactions on Programming Languages and Systems, 13(1), 1991, 99-123, ISSN 0164-0925.
• [11] Brogi, A., Jacquet, J.: On the Expressiveness of Coordination Models, in: Ciancarini and Hankin [23], 134-149.
• [12] Busi, N., Gorrieri, R., Zavattaro, G.: Comparing Three Semantics for Linda-like Languages, Theoretical Computer Science, 240, 1990, 49-90, ISSN 0304-3975.
• [13] Busi, N., Gorrieri, R., Zavattaro, G.: A Process Algebraic View of Linda Coordination Primitives, Theoretical Computer Science, 192(2), 1998, 167-199, ISSN 0304-3975.
• [14] Busi, N., Gorrieri, R., Zavattaro, G.: On the Expressiveness of Linda Coordination Primitives, Information and Computation, 156(1-2), January 2000, 90-121, ISSN 0890-5401.
• [15] Busi, N., Gorrieri, R., Zavattaro, G.: Process Calculi for Coordination: From Linda to JavaSpaces, in: Algebraic Methodology and Software Technology (T. Rus, Ed.), vol. 1816 of LNCS, Springer-Verlag, 2000, ISBN 3-540-67530-2, 198-212.
• [16] Busi, N., Rowstron, A., Zavattaro, G.: State- and Event-Based Reactive Programming in Shared Dataspaces, in: Arbab and Talcott [4], 111-124.
• [17] Busi, N., Zavattaro, G.: Event Notification in Data-driven Coordination Languages: Comparing the Ordered and Unordered Interpretations, in: Carrol et al. [20], 233-239.
• [18] Busi, N., Zavattaro, G.: On the Serializability of Transactions in JavaSpaces, Electronic Notes in Theoretical Computer Science, 54, July 2001, ISSN 1571-0661.
• [19] Carriero, N., Gelernter, D.: How to write parallel programs: a guide to the perplexed, ACM Computing Surveys, 21(3), 1989, 323-357, ISSN 0360-0300.
• [20] Carrol, J., Damiani, E., Haddad, H., Oppenheim, D., Eds.: The 2000 ACMSymposium on Applied Computing (SAC 2000), ACM, Como, Italy, 19-21 March 2000, ISBN 1-58113-239-5, Special Track on Coordination Models, Languages and Applications.
• [21] Chung, J.-Y., Lin, K.-J., Mathieu, R. G.: Guest Editors' Introduction: Web Services Computing - Advancing Software Interoperability., IEEE Computer, 36(10), 2003, 35-37.
• [22] Ciancarini, P.: Coordination models and languages as software integrators, ACM Computing Surveys, 28(2), June 1996, 300-302, ISSN 0360-0300.
• [23] Ciancarini, P., Hankin, C., Eds.: Coordination Languages and Models, vol. 1061 of LNCS, Springer-Verlag, April 1996, ISBN 3-540-61052-9.
• [24] Ciancarini, P., Jensen, K. K., Yankelevich, D.: On the Operational Semantics of a Coordination Language, in: Object-Based Models and Languages for Concurrent Systems (P. Ciancarini, O. Nierstrask, O. Yonezawa, Eds.), vol. 924 of LNCS, Springer-Verlag, 1994, ISBN 3-540-59450-7, 77-106.
• [25] Ciancarini, P., Wolf, A. L., Eds.: Coordination Languages and Models, vol. 1594 of LNCS, Springer-Verlag, 1999, ISBN 3-540-65836-X.
• [26] De Nicola, R., Pugliese, R.: A Process Algebra based on Linda, in: Ciancarini and Hankin [23], 160-178.
• [27] De Nicola, R., Pugliese, R., Rowstron, A.: Proving the Correctness of Optimising Destructive and Nondestructive Reads over Tuple Spaces, in: Porto and Roman [49], 66-80.
• [28] Denti, E., Natali, A., Omicini, A.: On the Expressive Power of a Language for Programming Coordination Media, in: 1998 ACM Symposium on Applied Computing (SAC'98), ACM, Atlanta, GA, USA, 27 February - 1 March 1998, ISBN 0-89791-969-6, 169-177.
• [29] Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces: Principles, Patterns, and Practice, Addison-Wesley, 1999, ISBN 0-201-30955-6.
• [30] Garlan, D., Le Métayer, D., Eds.: Coordination Languages and Models, vol. 1282 of LNCS, Springer-Verlag, 1997, ISBN 3-540-63383-9.
• [31] Gelernter, D.: Multiple Tuple Spaces in Linda, in: Parallel Architectures and Languages Europe (PARLE'89), vol. II: Parallel Languages, Springer-Verlag, 1989, ISBN 3-540-51285-3, 20-27.
• [32] Gelernter, D., Carriero, N.: Coordination Languages and their Significance, Communications of the ACM, 35(2), 1992, 96-107, ISSN 0001-0782.
• [33] Gelernter, D., Zuck, L.: On What Linda is: Formal Description of Linda as a Reactive System, in: Garlan and Le Métayer [30], 187-219.
• [34] van Glabbeek, R.: The Linear Time - Branching Time Spectrum I. The semantics of Concrete, Sequential Processes, in: Bergstra et al. [6], chapter 1, 3-100.
• [35] Milner, R.: Communication and Concurrency, Prentice Hall, 1989, ISBN 0-13-114984-9.
• [36] Milner, R.: Communicating and Mobile Systems: The π-calculus, Cambridge University Pres, 1999, ISBN 0-521-65869-1.
• [37] Omicini, A.: On the Semantics of Tuple-based Coordination Models, 1999 ACM Symposium on Applied Computing (SAC'99), San Antonio (TX), 28 February - 2 March 1999, ISBN 1-58113-086-4.
• [38] Omicini, A., Denti, E.: Formal ReSpecT, Electronic Notes in Theoretical Computer Science, 48, June 2001, 179-196, ISSN 1571-0661.
• [39] Omicini, A., Denti, E.: From Tuple Spaces to Tuple Centres, Science of Computer Programming, 41(3), November 2001, 277-294, ISSN 0167-6423.
• [40] Omicini, A., Ossowski, S.: Objective versus Subjective Coordination in the Engineering of Agent Systems, in: Intelligent Information Agents: An AgentLink Perspective (M. Klusch, S. Bergamaschi, P. Edwards, P. Petta, Eds.), vol. 2586 of LNAI: State-of-the-Art Survey, Springer-Verlag, March 2003, ISBN 3-540-00759-8, 179-202.
• [41] Omicini, A., Zambonelli, F.: Coordination for Internet Application Development, Journal of Autonomous Agents and Multi-Agent Systems, 2(3), 1999, 251-269, ISSN 1387-2532.
• [42] Papadopoulos, G. A., Arbab, F.: Configuration and Dynamic Reconfiguration of Components Using the Coordination Paradigm, Future Generation Computer Systems, 17(8), 2001, 1023-1038, ISSN 0167-739X.
• [43] Papazoglou, M. P., Georgakopoulos, D.: Special Section: Service-oriented computing. Introduction, Communications of the ACM, 46(10), 2003, 24-28.
• [44] Papdopoulos, G. A., Arbab, F.: Coordination Models and Languages, Advances in Computers, 46, 1998, 329-400.
• [45] Peltz, C.: Web Services Orchestration and Choreography, IEEE Computer, 36(10), 2003, 46-52.
• [46] Picco, G. P., Murphy, A. L., Roman, G.-C.: LIME: Linda meets mobility, in: The 1999 International Conference on Software Engineering (ICSE'99), ACM, Los Angeles, CA, USA, 16-22 May 1999, ISBN 1-58113-074-0, 368-377.
• [47] Pierce, B. C.: Foundational Calculi for Programming Languages, in: The Computer Science and Engineering Handbook (A. B. Tucker, Ed.), CRC Press, 1997, ISBN 0-8493-2909-4, 2190-2207.
• [48] Plotkin, G.: A structural approach to operational semantics, Technical Report DAIMI FN-19, Department of Computer Science, AArhus University, Denmark, 1991.
• [49] Porto, A., Roman, G.-C., Eds.: Coordination Languages and Models, vol. 1906 of LNCS, Springer-Verlag, 2000, ISBN 3-540-41020-1.
• [50] Ricci, A., Omicini, A., Viroli, M.: Extending ReSpecT for Multiple Coordination Flows, in: Arabnia [1], 1407-1413.
• [51] Rowstron, A.: Optimising the Linda in Primitive: Understanding Tuple Space Run-times, in: Carrol et al. [20], 227-232.
• [52] Shapiro, E. Y.: Embeddings Among Concurrent Programming Languages (Preliminary Version), in: CONCUR '92, Third International Conference on Concurrency Theory (W. R. Cleaveland, Ed.), vol. 630 of LNCS, Springer-Verlag, 1992, ISBN 3-540-55822-5, 486-503.
• [53] Snyder, J., Menezes, R.: Using Logical Operators as an Extended Coordination Mechanism in Linda, in: Arbab and Talcott [4], 317-331.
• [54] Viroli, M., Omicini, A.: Tuple-based Models in the Observation Framework, in: Arbab and Talcott [4], 364-379.
• [55] Viroli, M., Omicini, A., Ricci, A.: On the Expressiveness of Event-Based Coordination Media, in: Arabnia [1], 1414-1420.
• [56] Viroli, M., Ricci, A.: Tuple-Based Coordination Models in Event-Based Scenarios, in: 22nd International Conference on Distributed Computing Systems Workshops (ICDCSW'02), IEEE Press, 2-3 July 2002, ISBN 0-7695-1588-6, 595-601.
• [57] Wyckoff, P., McLaughry, S. W., Lehman, T. J., Ford, D. A.: T Spaces, IBM Journal of Research and Development, 37(3 - Java Techonology), 1998, 454-474, ISSN 0018-8670.