Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces

Authors:
Rocco De Nicola;Rosario Pugliese;Antony I. T. Rowstron
Affiliations:
-;-;-
Venue:
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Year:
2000

Citing 9
Cited 1

Linda in context

Communications of the ACM
Tuple analysis and partial evaluation strategies in the Linda precompiler

Selected papers of the second workshop on Languages and compilers for parallel computing
KLAIM: A Kernel Language for Agents Interaction and Mobility

IEEE Transactions on Software Engineering
Coordinating Multiagent Applications on the WWW: A Reference Architecture

IEEE Transactions on Software Engineering
Optimising the Linda in primitive: understanding tuple-space run-times

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Linda-based applicative and imperative process algebras

Theoretical Computer Science
WCL: A co-ordination language for geographically distributed agents

World Wide Web
Coordination for Internet Application Development

Autonomous Agents and Multi-Agent Systems
T spaces

IBM Systems Journal

Coordination as a Service

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.