Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and concurrency
On the serializability of transactions in shared dataspaces with temporary data
Proceedings of the 2002 ACM symposium on Applied computing
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
IBM Systems Journal
Editorial message: special track on coordination models, languages and applications
Proceedings of the 2002 ACM symposium on Applied computing
On the serializability of transactions in shared dataspaces with temporary data
Proceedings of the 2002 ACM symposium on Applied computing
Comparing semantic frameworks for coordination: on the conformance issue for coordination media
Proceedings of the 2003 ACM symposium on Applied computing
| Hi-index | 0.00 |
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.