Abstract
In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a different process. The optimisation has been successfully used in a prototype run-time system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Rowstron. Optimising the Linda in primitive: Understanding tuple-space runtimes. In J. Carroll, E. Damiani, H. Haddad, and D. Oppenheim, editors, Proceedings of the 2000 ACM Symposium on Applied Computing, volume 1, pages 227–232. ACM Press, March 2000.
Sun Microsystems. Javaspace specification. available at: http://java.sun.com/, 1999.
R. De Nicola, G. Ferrari, and R. Pugliese. KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 24(5):315–330, 1998.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.
P. Ciancarini, R. Tolksdorf, F. Vitali, D. Rossi, and A. Knoche. Coordinating multiagent applications on the WWW: A reference architecture. IEEE Transactions on Software Engineering, 24(5):362–366, 1998.
P. Wyckoff, S. McLaughry, T. Lehman, and D. Ford. TSpaces. IBM Systems Journal, 37(3):454–474, 1998.
A. Omicini and F. Zambonelli. Coordination for internet application development. Autonomous Agents and Multi-agent Systems, 2(3):251–269, 1999. Special Issue on Coordination Mechanisms and Patterns for Web Agents.
A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1(3):167–179, 1998.
J. Carreria, L. Silva, and J. Silva. On the design of Eilean: A Linda-like library for MPI. Technical report, Universidade de Coimbra, 1994.
N. Carriero and D. Gelernter. Tuple analysis and partial evaluation strategies in the Linda precompiler. In D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, Research Monographs in Parallel and Distributed Computing, pages 114–125. MIT Press, 1990.
R. De Nicola and R. Pugliese. Linda based applicative and imperative process algebras. Theoretical Computer Science, 238(1–2):389–437, 2000.
G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Dep. of Computer Science, Aarhus University, Denmark, 1981.
R. De Nicola, R. Pugliese, and A. Rowstron. Proving the correctness of optimising destructive and non-destructive reads over tuple spaces. Technical Report available at: http://music.dsi.unifi.it/, Dipartimento di Sistemi e Informatica, Univ. Firenze, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Nicola, R., Pugliese, R., Rowstron, A. (2000). Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces. In: Porto, A., Roman, GC. (eds) Coordination Languages and Models. COORDINATION 2000. Lecture Notes in Computer Science, vol 1906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45263-X_5
Download citation
DOI: https://doi.org/10.1007/3-540-45263-X_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41020-1
Online ISBN: 978-3-540-45263-8
eBook Packages: Springer Book Archive