Applications experience with Linda
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Tuple centres for the coordination of Internet agents
Proceedings of the 1999 ACM symposium on Applied computing
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Making tuple spaces safe for heterogeneous distributed systems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Cryptographic sealing for information secrecy and authentication
Communications of the ACM
Coordinating processes with secure spaces
Science of Computer Programming - Special issue on coordination languages and architectures
A Java Middleware for Guaranteeing Privacy of Distributed Tuple Spaces
FIDJI '01 Revised Papers from the International Workshop on Scientific Engineering for Distributed Java Applications
Cryptography and Relational Database Management Systems
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Programming Access Control: The KLAIM Experience
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
Security Issues and Requirements for Internet-Scale Publish-Subscribe Systems
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
WSSecSpaces: a secure data-driven coordination service for Web Services applications
Proceedings of the 2004 ACM symposium on Applied computing
Secure distribution of events in content-based publish subscribe systems
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
CBSE'06 Proceedings of the 9th international conference on Component-Based Software Engineering
Evolution on-the-fly with paradigm
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Data driven language for agents secure interaction
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
Hi-index | 0.00 |
A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this paper, we propose a new kind of VSM, called a tagged set. Each element in the VSM is a value with an associated tag, and values are read or removed from the VSM by matching the tag. Tagged sets exhibit three properties useful for VSMs: Ease of use. A tagged value naturally corresponds to the notion that data has certain attributes, expressed by the tag, which can be used for later retrieval. Flexibility. Tags are implemented as propositional logic formulae, and selection as logical implication, so the resulting system is quite powerful. Tagged sets naturally support a variety of applications, such as shared data repositories (e.g., for media or e-mail), message passing, and publish/subscribe algorithms; they are powerful enough to encode existing VSMs, such as Linda spaces. Security. Our notion of tags naturally corresponds to keys, or capabilities: a user may not select data in the set unless she presents a legal key or keys. Normal tags correspond to symmetric keys, and we introduce asymmetric tags that correspond to public and private key pairs. Treating tags as keys permits users to easily specify protection criteria for data at a fine granularity. This paper motivates our approach, sketches its basic theory, and places it in the context of other data management strategies.