Abstract
WCL is an inter-agent co-ordination language designed for Internet and Web based agent systems. WCL is based on shared associative memories called tuple spaces, as introduced in Linda. In this paper we describe a novel run-time system for WCL. This distributed run-time system is radically different from traditional run-time systems supporting tuple spaces because it performs on-the-fly analysis of the usage of tuple spaces and moves tuple-space data between machines dynamically. Experimental results show that this approach provides significant speed improvements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Carriero. Implementation of Tuple Space Machines. PhD thesis, Yale University, 1987. YALEU/DCS/RR-567.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.
D. Gelernter. Generative communication in linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
A. Douglas, A. Wood, and A. Rowstron. Linda implementation revisited. In Transputer and occam developments, pages 125–138. IOS Press, 1995.
A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1998.
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.
Sun Microsystems. Javaspace specification, revision 0.4. Unpublished beta draft specification., 1997.
Peter Wyckoff, Stephen McLaughry, Tobin Lehman, and Daniel Ford. TSpaces. To appear in IBM Systems Journal, August, 1998.
P. Ciancarini, A. Knocke, R. Tolksdorf, and F. Vitali. PageSpace: An architecture to coordinate distributed applications on the web. In 5th International World Wide Web Conference, 1995.
A. Rowstron, S. Li, and S. Radina. C2AS: A system supporting distributed web applications composed of collaborating agents. In WETICE, pages 87–92, 1997.
A. Rowstron. Bulk primitives in Linda run-time systems. PhD thesis, Department of Computer Science, University of York, 1997.
P. Butcher, A. Wood, and M. Atkins. Global synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505–516, 1994.
A. Rowstron and A. Wood. Solving the linda multiple rd problem using copy-collect. Science of Computer Programming, 31(2-3), July 1998.
A. Rowstron and A. Wood. An efficient distributed tuple space implementation for networks of workstations. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Euro-Par’96, volume 1123 of Lecture Notes in Computer Science, pages 510–513. Springer-Verlang, 1996.
R. Menezes and A. Wood. Garbage Collection in Open Distributed Tuple Space Sys tems. In Proceedings of 15th Brazilian Computer Networks Symposi um — SBRC’97, 1997.
B. Anderson and D. Shasha. Persistent Linda: Linda + Transactions + Query Processing. In Research Directions in High-Level Parallel Programming Languages, LNCS 574, 1991.
Scientific Computing Associates. Paradise: User’s guide and reference manual. Scientific Computing Associates, 1996.
A. Rowstron. Mobile co-ordination: Providing fault tolerance in tuple space based co-ordination languages. In To appear Coordination’99. Springer Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rowstron, A., Wray, S. (1999). A Run-Time System for WCL. In: Bal, H.E., Belkhouche, B., Cardelli, L. (eds) Internet Programming Languages. ICCL 1998. Lecture Notes in Computer Science, vol 1686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47959-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-47959-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66673-8
Online ISBN: 978-3-540-47959-8
eBook Packages: Springer Book Archive