Abstract
A number of different coordination models for specifying inter-process communication and synchronisation rely on a notion of shared dataspace. Many of these models are extensions of the Linda coordination model, which includes operations for adding, deleting and testing the presence/absence of data in a shared dataspace.
We compare the expressive power of three classes of coordination models based on shared dataspaces. The first class relies on Linda’s communication primitives, while a second class relies on the more general notion of multi-set rewriting (e.g., like Bauhaus Linda or Gamma). Finally, we consider a third class of models featuring communication transactions that consist of sequences of Linda-like operations to be executed atomically (e.g., like in Shared Prolog or PoliS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Arbab, I. Herman and P. Spilling. An overview of MANIFOLD and its implementation. Concurrency: practice and experience, 5(1): 23–70, 1993.
J.M. Andreoli and R. Pareschi. Linear Objects: logical processes with builtin inheritance. New Generation Computing, 9(3-4):445–473, 1991.
J. Banatre and D. LeMetayer. Programming by Multiset Transformation. Communications of the ACM, 36(1):98–111, 1991.
E. Best, F.S. de Boer and C. Palamidessi. Partial Order and SOS Semantics for Linear Constraint Programs. In D. Garlan and D. Le Metayer (editors). Coordination’97: Second International Conference on Coordination Models and Languages. LNCS. Springer-Verlag, 1997 [18].
M. Bonsangue, J. Kok, and G. Zavattaro. Comparing coordination models based on shared distributed replicated data. To appear in proc. of SAC’99.
A. Brogi and P. Ciancarini. The Concurrent Language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99–123, January 1991.
A. Brogi and J.-M. Jacquet. On the Expressiveness of Linda-like Concurrent Languages. Electronic Notes in Theoretical Computer Science, 1998.
N. Busi, R. Gorrieri, and G. Zavattaro. On the Turing Equivalence of Linda Coordination Primitives. Electronic Notes in Theoretical Computer Science, 7, 1997.
N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192(2):167–199, 1998.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.
N. Carriero, D. Gelernter and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nier-strasz and A. Yonezawa (editors) Object based models and languages for concurrent systems, LNCS 924, pages 66–76, Springer-Verlag, 1994.
P. Ciancarini. Distributed programming with logic tuple spaces. New Generation Computing, 12(3):251–284, 1994.
P. Ciancarini and C. Hankin (editors). Coordination’96: First International Conference on Coordination Models and Languages. LNCS 1061. Springer-Verlag, 1996.
P. Ciancarini and D. Rossi. Jada: coordination and communication for Java agents. In Second Int. Workshop on mobile object systems, LNCS 1222, pages 213–228, Springer-Verlag, 1996.
F.S. de Boer and C. Palamidessi. Embedding as a Tool for Language Comparison. Information and Computation, 108(1):128–157, 1994.
R. De Nicola, G. Ferrari and R. Pugliese. KLAIM: a kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 1998.
M. Felleisen. On the Expressive Power of Programming Languages. In N. Jones, editor, Proc. ESOP’90, LNCS 432, pages 134–151. Springer-Verlag, 1990.
D. Garlan and D. Le Metayer (editors). Coordination’97: Second International Conference on Coordination Models and Languages. LNCS. Springer-Verlag, 1997.
D. Gelernter and N. Carriero. Coordination Languages and Their Significance. Communications of the ACM, 35(2):97–107, 1992.
J.M. Jacquet and K. De Bosschere. On the Semantics of muLog. Future Generation Computer Systems Journal:10, pages 93–135, Elsevier, 1994.
J.-M. Jacquet and L. Monteiro. Towards Resource Handling in Logic Programming: the PPL Framework and its Semantics. Computer Languages, 22(2/3):51–77, 1996.
G.A. Papadopolous and F. Arbab. Coordination models and languages. Advances in Computers, 48, Academic-Press, 1998.
A. Rowstron and A. Wood. BONITA: A set of tuple space primitives for distributed coordination. In 30th Hawaii Int. Conf. on System Sciences, IEEE Press, Vol. 1, pages 379–388, 1997.
V.A. Saraswat. Concurrent Constraint Programming. The MIT Press, 1993.
E.Y. Shapiro. Embeddings among Concurrent Programming Languages. In W.R. Cleaveland, editor, Proc. of CONCUR’92, pages 486–503. Springer-Verlag, 1992.
R. Tolksdorf. Coordinating services in open distributed systems with LAURA. In C. Hankin (editors). Coordination’96: First International Conference on Coordination Models and Languages. LNCS 1061. Springer-Verlag, 1996 [13], pages 386–402.
P. Wegner. Why Interaction Is More Powerful Than Algorithms. Communications of the ACM, 1997.
G. Zavattaro. On the incomparability of Gamma and Linda. Technical report SEN-R9827, Department of Software Engineering, CWI, 1998.
G. Zavattaro. Towards a hierarchy of negative test operators for generative communication. Electronic Notes in Theoretical Computer Science, 16(2):83–100, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brogi, A., Jacquet, JM. (1999). On the Expressiveness of Coordination Models. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-48919-3_11
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