ACM Home Page
Please provide us with feedback. Feedback
Garbage collection and task deletion in distributed applicative processing systems
Full text PdfPdf (949 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1982 ACM symposium on LISP and functional programming table of contents
Pittsburgh, Pennsylvania, United States
Pages: 168 - 178  
Year of Publication: 1982
ISBN:0-89791-082-6
Authors
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 29,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800068.802147
What is a DOI?

ABSTRACT

The problem of automatic storage reclamation for distributed implementations of applicative languages is explored. Highly parallel distributed systems have several unique characteristics that complicate the reclamation process; in this setting, the deficiencies of existing storage reclamation schemes are thus noted. A real-time, effectively distributed, garbage collector of the mark-sweep variety, called the marking-tree collector, is shown to accomplish reclamation in parallel with the main computation, with no centralized data or control other than a logical rendezvous between phases of the collector. In addition, it is capable of finding and subsequently deleting active processes which are determined to be no longer relevant to the computation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
Bishop, P. Computer Systems With a Very Large Address Space and Garbage Collection. Ph.D. Th., Laboratory for Computer Science, Mass. Institute of Technology, May 1977.
5
6
 
7
D.P. Friedman and D.S. Wise. Applicative multiprogramming. Tech. Rept. 72, Computer Science Dept., Indiana University, Dec., 1978.
 
8
Friedman, D.P. and Wise, D.S. "Aspects of applicative programming for parallel processing." IEEE Trans. Computers 27, 4 (April 1978), 289-296.
9
 
10
Halstead, R.H. Jr. Reference tree networks: virtual machine and implementation. Tech. Rept.MIT/LCS/TR-22, Massachusetts Institute of Technology Laboratory for Computer Science, 1979.
 
11
Hearn, A.C. Reduce 2 symbolic mode primer. Utah Symbolic Computation Group, Operating Note 5.1, University of Utah, October, 1974.
 
12
Hibino, Y. "A Practical Parallel Garbage Collection Algorithm and its Implementation." Sigarch Newsletter 8, 3 (May 1980),.
 
13
 
14
Keller, R.M., Lindstrom, G., and Patil, S. A loosely-coupled applicative multi-processing system. AFIPS, AFIPS, June, 1979, pp. 613-622.
 
15
Keller, R.M. Semantics and Applications of Function Graphs. Tech. Rept. UUCS-80-112, Department of Computer Science, University of Utah, Oct., 1980.
 
16
Kung, H.T. and Song, W. An Efficient Parallel Garbage Collection System and Its Correctness Proof. Department of Computer Science, Carnegie-Mellon Univ., Sept., 1977.
 
17
Lieberman, H. and Hewitt, C. A Real Time Garbage Collector That Can Recover Temporary Storage Quickly. AI Memo 569, Mass. Institute of Technology, Cambridge, Mass., April, 1980.
 
18
Nori, A.K. A Storage Reclamation Scheme For Applicative Multiprocessor System. Master Th., Department of Computer Science, University of Utah, Dec. 1979.
19
20
21
 
22

CITED BY  26

Collaborative Colleagues:
Paul Hudak: colleagues
Robert M. Keller: colleagues