An Effective Garbage Collection Strategy for Parallel Programming Languages on Large Scale Distributed-Memory Machines

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 7, 1997, Pages 264-275

  Taura, Kenjiro ^a   Yonezawa, Akinori ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346045027     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/263767.263801     Document Type: Article

References (34)

1. Saleh E. Abdullahi, Eliot E. Miranda, and Graem A. Ringwood. Collection schemes for distributed garbage. In Proceedings of International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science, pages 43-81. Springer-Verlag, 1992.
2. Andrew W. Appel. Simple generational garbage collection and fast allocation. Software, Practice & Experience, 19(2):171-183, February 1989.
3. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
4. Josh Barnes and Piet Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324:446-449, 1986.
5. David I. Bevan. Distributed garbage collection using reference counting. In Proceedings of Parallel Architectures and Languages Europe, number 258, 259 in Lecture Notes in Computer Science, pages 176-187, Springer-Verlag, 1987.
6. Andrew Birrel, David Evers, Greg Nelson, Susan Owicki, and Edward Wobber. Distributed garbage collection for network objects. Technical Report 116, Digital Systems Research Center, 1993.
7. Andrew Birrell, Greg Nelson, Susan Owicki, and Edward Wobber. Network objects. In Proceedings of Fourteenth Symposium on Operating Systems Principles (SOSP), pages 217-230, 1993.
8. Hans-Juergen Boehm. Space efficient conservative garbage collection. In Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation, pages 197-206, 1993.
9. Hans-Juergen Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software Practice and Experience, 18(9):807-820, 1988.
10. K. Mani Chandy and Leslie Lamport. Distributed snap-shots: Determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63-75, 1985.
11. Benjamin Goldberg. Generational reference counting: A reduced-communication distributed strage reclamation scheme. In Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation, pages 313-321, 1989.
12. Ananth Y. Grama, Vipin Kumar, and Ahmed Sameh. Scalable parallel formulation of the Barnes-Hut method for n-body simulations. In Proceedings of Supercomputing '94, pages 439-448, 1994.
13. Kenichi Hayashi, Tunehisa Doi, Takeshi Horie, Yoichi Koyanagi, Osamu Shiraki, Nobutaka Imamura, Toshiyuki Shimizu, Hiroaki Ishihata, and Tatsuya Shindo. AP1000+: Architectural support of PUT/GET interface for parallelizing compiler. In Proceedings of Architectural Support for Programming Languages and Operating Systems, pages 196-207, 1994.
14. K. Hiyane. Generation of a set of pareto-optimal solutions for multiobjective optimization by parallel genetic algorithms and its quantitative estimation. In 9th SICE Symposium on Decentralized Autonomous Systems, pages 295-300, 1997. (In Japanese).
15. John Hughes. A distributed garbage collection algorithm. In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 256-272. Springer-Verlag, 1985.
16. Nobuyuki Ichiyoshi, Kazuaki Rokusawa, Katsuto Nakajima, and Yu Inamura. A new external reference management and distributed unificatin for KL1. In New Generation Computing, pages 159-177, 1990.
17. Richard Jones and Rafael Lins. Garbage Collection, Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
18. Niels Christian Juul and Eric Jul. Comprehensive and robust garbage collection in a distributed system. In Proceedings of International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science, pages 103-115. Springer-Verlag, 1992.
19. Tomio Kamada, Satoshi Matsuoka, and Akinori Yonezawa. Efficient parallel global garbage collection on massively parallel computers. In Proceedings of Supercomputing '94, pages 79-88, 1994.
20. T. Kasami. An efficient recognition and syntax algorithm for context-free languages. Technical report, Air Force Cambridge Research Lab, 1965.
21. Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the Pi-Calculus. In Conference Record of POPL'96: 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1996.
22. Bernard Lang, Christian Queinnec, and José Piquer. Garbage collecting the world. In Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 39-58, 1992.
23. Akihiro Nakaya, Kenji Yamamoto, and Akinori Yonezawa. RNA secondary structure prediction using highly parallel computers. Comput. Applic. Biosci. (CABIOS), 11, 1995.
24. Anton Nijholt. Parallel approaches to context-free language parsing. In Parallel Natural Language Processing, pages 135-167. Ablex Publishing Corporation, 1994.
25. Takashi Ninomiya, Kenjiro Taura, Kentaro Torisawa, and Jun'ichi Tsujii. A scalable implementation of parallel CKY algorithm in concurrent object-oriented language ABCL/f. In Proceedings of JSSST Workshop on Object-Oriented Computing (WOOC), 1997. (in Japanese).
26. José M. Piquer. Indirect reference counting: A distributed garbage collection algorithm. In Proceedings of Parallel Architectures and Languages Europe, number 505, 506 in Lecture Notes in Computer Science, pages 150-165. Springer-Verlag, 1991.
27. Plainfossé and Shapiro. A survey of distributed garbage collection techniques. In Proceedings of International Workshop on Memory Management, number 986 in Lecture Notes in Computer Science. Springer-Verlag, 1995.
28. Kenjiro Taura, Satoshi Matsuoka, and Akinori Yonezawa. ABCL/f: A future-based polymorphic typed concurrent object-oriented language - its design and implementation -. In Proceedings of the DIMACS workshop on Specification of Parallel Algorithms, number 18 in Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pages 275-292, 1994.
29. Kenjiro Taura, Satoshi Matsuoka, and Akinori Yonezawa. StackThreads: An abstract machine for scheduling fine-grain threads on stock CPUs. In Proceedings of Workshop on Theory and Practice of Parallel Programming, number 907 in Lecture Notes on Computer Science, pages 121-136. Springer Verlag, 1994.
30. Kenjiro Taura and Akinori Yonezawa. Fine-grain multithreading with minimal compiler support - a cost effective approach to implementing efficient multithreading languages. In Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1997. (to appear).
31. Michael S. Warren and John K. Salmon. Astrophysical N-body simulations using hierarchical tree data structures. In Proceedings of Supercomputing '92, pages 570-576, 1992.
32. Michael S. Warren and John K. Salmon. A parallel hashed oct-tree N-body algorithm. In Proceedings of Supercomputing '93, pages 12-21, 1993.
33. Paul Watson and Ian Watson. An efficient garbage collection scheme for parallel computer architectures. In Proceedings of Parallel Architectures and Languages Europe, number 258, 259 in Lecture Notes in Computer Science, pages 432-443, Springer-Verlag, 1987.
34. D. H. Younger. Recognition and parsing of context-free languages. Information and Control, 2(10):189-208, 1967.