Communications of the ACM
Persistant Linda: Linda + Transactions + Query Processing
Research Directions in High-Level Parallel Programming Languages
Using Asynchronous Tuple-Space Access Primitives (BONITA Primitives) for Process Co-ordination
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
IBM Systems Journal
Extending the Matching Facilities of Linda
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
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
Efficient agent communication in multi-agent systems
Software Engineering for Multi-Agent Systems III
| Hi-index | 0.00 |
In this paper we describe the concept of mobile co-ordination, a general purpose approach to overcoming failure of agents when using distributed tuple spaces. We demonstrate why mobile co-ordination is better than using existing techniques such as transactions, how mobile co-ordination can provide extra functionality in the form of agent wills, and how the framework to provide this can be implemented in Java and can be used with multiple different tuple space co-ordination languages. Experimental results are presented to show performance gains made when mobile co-ordination is used.