Coordinating autonomous entities with STL
ACM SIGAPP Applied Computing Review - Special issue on coodination languages and models
An asynchronous distributed systems platform for heterogeneous environments
Proceedings of the 8th ACM SIGOPS European workshop on Support for composing distributed applications
Experiences of Using Generative Communications to Support AdaptiveMobile Applications
Distributed and Parallel Databases - Special issue on mobile data management and applications
Coordinating autonomous entities
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Optimising the Linda in primitive: understanding tuple-space run-times
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
Coordination in a Content-Addressable Web
Autonomous Agents and Multi-Agent Systems
On the expressiveness of coordination via shared dataspaces
Science of Computer Programming - Special issue on coordination languages and architectures
Using mobile code to provide fault tolerance in tuple space based coordination languages
Science of Computer Programming - Special issue on coordination languages and architectures
ICCL'98 Workshop on Internet Programming Languages
On the Expressiveness of Coordination Models
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
The STL++ Coordination Language: A Base for Implementing Distributed Multi-agent Applications
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
On Timed Coordination Languages
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
A Principled Semantics for inp
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Using Logical Operators as an Extended Coordination Mechanism in Linda
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
The SPACETUB Models and Framework
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
C2AS: A System Supporting Distributed Web Applications Composed of Collaborating Agents
WET-ICE '97 Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises
The Cost of Communication Protocols and Coordination Languages in Embedded Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Supporting ordering and consistency in a distributed Event Heap for Ubiquitous Computing
Personal and Ubiquitous Computing
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Coordination with multicapabilities
Science of Computer Programming
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
Synchronizing control flow in a tuplespace-based, distributed workflow management system
Proceedings of the 10th international conference on Electronic commerce
Objective coordination in multi-agent system engineering: design and implementation
Objective coordination in multi-agent system engineering: design and implementation
Using agent wills to provide fault-tolerance in distributed shared memory systems
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
| Hi-index | 0.00 |
In the last few years the use of distributed structuredshared memory paradigms for coordination betweenparallel processes has become common. One of themost well known implementations of this paradigm isthe shared tuple space model (as used in Linda). Inthis paper we describe a new set of primitives for fullydistributed coordination of processes and agents usingtuple spaces, called the Bonita primitives. The Lindaprimitives provide synchronous access to tuple spaces,whereas the Bonita primitives provide asynchronousaccess to tuple spaces. The proposed primitives areable to mimic the Linda primitives, therefore providingthe ease of use and expressibility of Linda together witha number of advantages for the coordination of agentsor processes in distributed environments. The primitives allow user processes to perform computation concurrently with tuple space accesses, and provide new coordination constructs which lead to more efficientprograms.In this paper we present the (informal) semantics ofthe Bonita primitives, a description of how the Lindaprimitives can be modelled using them and a demonstration of the advantages of the Bonita primitives over the Linda primitives.