How to write parallel programs: a guide to the perplexed
ACM Computing Surveys (CSUR)
The Flux OSKit: a substrate for kernel and language research
Proceedings of the sixteenth ACM symposium on Operating systems principles
Limbo: a tuple space based platform for adaptive mobile applications
ICODP/ICDP '97 Proceedings of the IFIP/IEEE international conference on Open distributed processing and distributed platforms
Proceedings of the 21st international conference on Software engineering
Communications of the ACM
Java Virtual Machine Specification
Java Virtual Machine Specification
The development of a distributed capability system for VLOS
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Extending ReSpecT for Multiple Coordination Flows
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
The Continuing Evolution of VLOS
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
Creation and Analysis of a JavaSpace-based Distributed Genetic Algorithm
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
Solving the LINDA Multiple rd Problem
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Programmable Coordination Media
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Implementation of tuple space machines
Implementation of tuple space machines
IBM Systems Journal
Hi-index | 0.00 |
VLOS is a research project investigating the feasibility of a tuple space-based distributed operating system for use on small to medium sized clusters of IntelTM PC based computers.Arguments are made that providing a mechanism by which tuple field matching expressions can be redefined from the usual "bitwise-binary" matching schemes to more complex (user-defined) matching expressions, would allow tuple space-based communications to be involved in the provision of distributed computational resources. These matching schemes also help simplify the complexity of distributed applications, by moving some of the computation from the application to the coordination medium.A test implementation of a tuple field matching system is described; the MiniMe matching expression language is an in-kernel compiler whose language has been designed specifically to disallow dangerous operations. Several examples of MiniMe matching expressions are shown.The protocol used by nodes to propagate expression matching changes is described here. The task that has redefined a tuple field matching expression blocks until the changes have been propagated across the cluster. These semantics ensure that the distributed application does not attempt to perform any operations using the tuple space prior to the field matching rule redefinition being propagated globally.