Using asynchronous tuple-space access primitives (Bonita primitives) for process co-ordination

Abstract

In this paper an interactive talk program is used to demonstrate the difference between the Linda primitives and the recently proposed Bonita primitives. Both use the concept of shared tuple spaces for inter-agent communication, but the Bonita primitives provide asynchronous tuple space access. The paper demonstrates the performance gains and the novel co-ordination patterns achievable using the Bonita primitives.KeywordsText LineUser ProcessReply MessageTuple SpaceMatching TupleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.