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

  • Antony Rowstron
Short Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)


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.


Text Line User Process Reply Message Tuple Space Matching Tuple 
These 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.CrossRefGoogle Scholar
  2. 2.
    A. Rowstron and A. Wood. An efficient distributed tuple space implementation for networks of workstations. In Euro-Par'96, LNCS 1123, pages 510–513. Springer-Verlag, 1996.Google Scholar
  3. 3.
    A. Rowstron and A. Wood. BONITA: A set of tuple space primitives for distributed coordination. In HICSS-30, volume 1, pages 379–388. IEEE CS Press, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antony Rowstron
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeUK

Personalised recommendations