Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 21st international conference on Software engineering
Communications of the ACM
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Experience with memory management in open Linda systems
Proceedings of the 2001 ACM symposium on Applied computing
Multiple Tuple Spaces in Linda
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
An Efficient Distributed Tuple Space Implementation for Networks of Workstations
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Bonita: A set of tuple space primitives for distributed coordination
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
On Relating Blackboards in the µLog Coordination Model
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
On the event coordination in multi-component systems
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Fundamenta Informaticae
Fundamenta Informaticae
A self-organizing approach to tuple distribution in large-scale tuple-space systems
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
| Hi-index | 0.00 |
In the last 20 years of research in coordination, researchers were able to demonstrate that distributed languages are made of two distinct parts: a computation and a coordination language. Among a plethora of coordination models (the basis of a coordination language) available today, Linda is perhaps the most successful. Linda advocates that processes should interact solely via associative shared memories called tuple spaces. Linda has developed from a single-tuple-space into a multiple-tuple-space model but the coordination mechanism used was never extended to express the multiple-tuple-space model full potential. This paper describes an extension of the Linda model, called LogOp, where primitives can use logical operators to combine tuple spaces on-the-fly. It is argued that LogOp provides a simpler and more elegant coordination mechanism than Linda. An implementation of LogOp is also described and initial results indicate that LogOp implementations are efficient when dealing with multiple tuple spaces.