Experience with memory management in open Linda systems

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2001, Pages 187-196

  Menezes, Ronaldo ^a  

^a Florida Institute of Technology   (United States)

Author keywords

Coordination systems; Garbage collection; Linda; Open systems

Indexed keywords

REFUSE COLLECTION;

COMPUTATION LANGUAGES; COORDINATION ENVIRONMENT; COORDINATION SYSTEMS; GARBAGE COLLECTION; LINDA; MEMORY MANAGEMENT;

OPEN SYSTEMS;

EID: 33645324145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/372202.372322     Document Type: Conference Paper

References (31)

1. G. A. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. The MIT Press, 1986.
2. G. Berry and G. Boudol. The Chemical Abstract Machine. In ACM, editor, Proceedings of the seventeenth annual ACM symposium on Principles of programming languages, pages 81-94, New York, NY, USA, 1990. ACM Press.
3. D. I. Bevan. Distributed Garbage Collection using Reference Counting. In W. J. Bakker, , L. Nijman, and P. C. Treleaven, editors, Proc. of Parallel Architectures and Languages Europe, pages 176-187. Springer-Verlag, June 1987. Lecture Notes in Computer Science, Vols. 258 and 259.
4. L. Cardelli. Wide area computation. Technical report, Microsoft Research, UK, 1999.
5. N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66-76. Springer-Verlag, Berlin, 1995.
6. P. Ciancarini, A. Knoche, R. Tolksdorf, and F. Vitali. PageSpace: An Architecture to Coordinate Distributed Applications on the Web. In Proc. of the 5th Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE '96), pages 340-345. IEEE Computer Society Press, June 1996.
7. G. E. Collins. A Method for Overlapping and Erasure of Lists. Communications of the ACM, 31(9):1128-1138, 1960.
8. A. Douglas, A. Rowstron, and A. Wood. isetl-Linda: Parallel Programming with Bags. Technical Report YCS-257, University of York, April 1995.
9. A. Douglas, A. Wood, and A. Rowstron. Linda Implementation Revisited. In P. Nixon, editor, Proc. of the 18th World Occam and Transputer User Group, pages 125-138. IOS Press, April 1995.
10. E. Freeman, S. Hupfer, and K. Arnold. JavaSpaces Principles, Patterns and Practice. Addison-Wesley, Reading, MA, USA, 1999. The Jini Technology Series.
11. D. Gelernter. Generative Communication in Linda. ACM transactions in programming languages and systems, 1:80-112, 1985.
12. D. Gelernter. Multiple Tuple Spaces in Linda. In Proc. of PARLE 89, pages 20-27. Springer-Verlag, 1989.
13. D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):96-107, February 1992.
14. J. Hughes. A Distributed Garbage Collection Algorithm. In J.-P. Jouannaud, editor, Proc. of ACM Conference on Functional Programming Languages and Computer Architecture, pages 256-272, 1985. Lecture Notes in Computer Science, Vol. 201.
15. S. C. Hupfer. Melinda: Linda with Multiple Tuple Space. Technical Report YALE/DCS/RR-766, Yale University, February 1990.
16. IBM Corporation. T Spaces Programmer's Guide, 1998. Eletronic version only, http : //www. almadén ibm.com/es/TSpaces /.
17. R. Jones and R. Lins. Garbage Collection - Algorithms for Automatic Dynamic Memory Management. Wiley, 1996.
18. C. A. Knoblock and J. L. Ambite. Agents for Information Gathering. In J. Bradshaw, editor, Software Agents. AAAI/MIT Press, Menlo Park, CA, 1997.
19. T. W. Malone and K. Crowston. What is Coordination Theory and How Can it Help Design Cooperative Work Systems? In Proceedings of the conference on Computer-supported cooperative work, CSCW '90, pages 357-370, 1990.
20. J. McCarthy. Recursive Functions of Symbolic Expressions and Their Computation by Machine. Communications of the ACM, 3(4):184-195, April 1960.
21. R. Menezes and A. Wood. Coordination of Distributed I/O in Tuple Space Systems. In Proc. of 31st Hawaii International Conference on System Sciences, volume VII, pages 216 225, Big Island, Hawaii, USA, 1998. IEEE Computer Society.
22. R. Menezes and A. Wood. Garbage Collection in Linda using Tuple Monitoring and Process Registration. In Proc. of the 10th International Conference on Parallel and Distributed Computing and Systems, pages 190 195, Las Vegas, Nevada, USA, 1998. Acta Press.
23. R. Menezes and A. Wood. Ligia: A Java based Linda-like Run-time System with Garbage Collection of Tuple Spaces. Technical Report YCS-304, Department of Computer Science, University of York, September 1998.
24. J. Piquer. Indirect Reference-Counting: A Distributed Garbage Collection Algorithm. In E. Odijik, M. Rem, and J.-C. Sayr, editors, Proc. of Parallel Architectures and Languages Europe, pages 150-165. Springer-Verlag, June 1991. Lecture Notes in Computer Science, Vols. 365 and 366.
25. A. Rowstron and A. Wood. Bonita: A Set of Tuple Space Primitives for Distributed Coordination. In H. El-Rewini and Y. N. Patt, editors, Proc. of the 30th Hawaii International Conference on System Sciences, volume 1, pages 379-388. IEEE Computer Society Press, January 1997.
26. Scientific Computing Associates Incorporated. Paradise - User's Guide and Reference Manual, 1994.
27. Scientific Computing Associates Incorporated. Linda: An Introduction and Example. Available from Scientific Computing Associates Incorporated, One Century Tower, New Haven, CT 06510-7010, U.S.A, 1994.
28. A. H. Sherman. G-Linda Reference Manual. Scientific Computing Associates, Inc., New Haven, Connecticut, 1990.
29. Sun Microsystems, Inc. JavaSpace Specification, June 1997. Revision 0.4.
30. Sun Microsystems, Inc. Jini Architecture Specification, January 1999. Revision 1.0.
31. G. Sutcliffe and J. Pinakis. PROLOG-Linda: An Embedding of Linda in muPROLOG. Technical report, The University of Western Australia, 1991.