A Run-Time System for WCL

  • Antony Rowstron
  • Stuart Wray
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1686)


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.


Round Trip Time User Agent Garbage Collection Control Layer Tuple Space 
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. Implementation of Tuple Space Machines. PhD thesis, Yale University, 1987. YALEU/DCS/RR-567.Google Scholar
  2. 2.
    N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.CrossRefGoogle Scholar
  3. 3.
    D. Gelernter. Generative communication in linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.zbMATHCrossRefGoogle Scholar
  4. 4.
    A. Douglas, A. Wood, and A. Rowstron. Linda implementation revisited. In Transputer and occam developments, pages 125–138. IOS Press, 1995.Google Scholar
  5. 5.
    A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1998.Google Scholar
  6. 6.
    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
  7. 7.
    Sun Microsystems. Javaspace specification, revision 0.4. Unpublished beta draft specification., 1997.Google Scholar
  8. 8.
    Peter Wyckoff, Stephen McLaughry, Tobin Lehman, and Daniel Ford. TSpaces. To appear in IBM Systems Journal, August, 1998.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    A. Rowstron, S. Li, and S. Radina. C2AS: A system supporting distributed web applications composed of collaborating agents. In WETICE, pages 87–92, 1997.Google Scholar
  11. 11.
    A. Rowstron. Bulk primitives in Linda run-time systems. PhD thesis, Department of Computer Science, University of York, 1997.Google Scholar
  12. 12.
    P. Butcher, A. Wood, and M. Atkins. Global synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505–516, 1994.CrossRefGoogle Scholar
  13. 13.
    A. Rowstron and A. Wood. Solving the linda multiple rd problem using copy-collect. Science of Computer Programming, 31(2-3), July 1998.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    B. Anderson and D. Shasha. Persistent Linda: Linda + Transactions + Query Processing. In Research Directions in High-Level Parallel Programming Languages, LNCS 574, 1991.Google Scholar
  17. 17.
    Scientific Computing Associates. Paradise: User’s guide and reference manual. Scientific Computing Associates, 1996.Google Scholar
  18. 18.
    A. Rowstron. Mobile co-ordination: Providing fault tolerance in tuple space based co-ordination languages. In To appear Coordination’99. Springer Verlag, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Antony Rowstron
    • 1
  • Stuart Wray
    • 2
  1. 1.Engineering DepartmentCambridge UniversityCambridgeUK
  2. 2.Cambridge University Computer LaboratoryCambridgeUK

Personalised recommendations