%I Springer
%V 1906
%T Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces
%P 66-80
%R 10.1007/3-540-45263-X_5
%B Coordination Models and Languages (COORDINATION 2000)
%X 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.
%E Antonio Porto
%E Catalin Roman
%L eprints334
%D 2000
%S Lecture Notes in Computer Science
%A Rocco De Nicola
%A Rosario Pugliese
%A Antony I. T. Rowstron