TY  - CHAP
UR  - http://dx.doi.org/10.1007/3-540-45263-X_5
M1  - 1906
AV  - none
Y1  - 2000///
ID  - eprints334
SP  - 66
T3  - Lecture Notes in Computer Science
TI  - Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces
N2  - 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.
EP  - 80
A1  - De Nicola, Rocco
A1  - Pugliese, Rosario
A1  - Rowstron, Antony I. T.
T2  - Coordination Models and Languages (COORDINATION 2000)
PB  - Springer
SN  - 3-540-41020-1
ED  - Porto, Antonio
ED  - Roman, Catalin
ER  -