On the serializability of transactions in shared dataspaces with temporary data

Several coordination platforms based on the shared dataspace approach introduces, besides the typical Linda-like coordination primitives (used to produce, consume, and test for the presence/absence of data in a common repository), a transaction mechanism provided to group coordination primitives which should be executed in such a way that either all succeed or none of them is performed. In this paper we continue the investigation of the serializability of transactions in shared dataspace coordination languages that has been initiated in [2]. The new contribution consists of the analysis of the interplay between transactions and temporary data, ie., data with an associated expiration time.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[3]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[4]  Nadia Busi,et al.  On the Serializability of Transactions in JavaSpaces , 2001, Electron. Notes Theor. Comput. Sci..

[5]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

[6]  Roberto Gorrieri,et al.  Temporary Data in Shared Dataspace Coordination Languages , 2001, FoSSaCS.

[7]  Tobin J. Lehman,et al.  T Spaces , 1998, IBM Syst. J..