A run-time system for WCL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1686, Issue , 1999, Pages 78-96

  Rowstron, Antony ^a   Wray, Stuart ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE PROCESSING;

AGENT SYSTEMS; ASSOCIATIVE MEMORY; ON THE FLIES; RUN TIME SYSTEMS; SPEED IMPROVEMENT; TUPLE SPACE; WEB BASED;

COMPUTER PROGRAMMING;

EID: 84956988269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47959-7_4     Document Type: Conference Paper

References (18)

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