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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rowstron, A. (1997). Using asynchronous tuple-space access primitives (Bonita primitives) for process co-ordination. In: Garlan, D., Le Métayer, D. (eds) Coordination Languages and Models. COORDINATION 1997. Lecture Notes in Computer Science, vol 1282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63383-9_98
Download citation
DOI: https://doi.org/10.1007/3-540-63383-9_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63383-9
Online ISBN: 978-3-540-69527-1
eBook Packages: Springer Book Archive