Experiences with compiler-directed storage reclamation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Experiences with compiler-directed storage reclamation

Full text

Pdf (1.07 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the conference on Functional programming languages and computer architecture table of contents

Copenhagen, Denmark

Pages: 95 - 105

Year of Publication: 1993

ISBN:0-89791-595-X

Author

James Hicks

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 8, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165180.165194 What is a DOI?

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	Andrew W. Appel, Garbage collection can be faster than stack allocation, Information Processing Letters, v.25 n.4, p.275-279, June 17, 1987 [doi>10.1016/0020-0190(87)90175-X]
	2	Zena M. Ariola, A syntactic approach to program transformations, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.116-129, June 17-19, 1991, New Haven, Connecticut, United States
	3	Jeffrey M. Barth, Shifting garbage collection overhead to compile time, Communications of the ACM, v.20 n.7, p.513-518, July 1977 [doi>10.1145/359636.359713]
	4	P. J. Burns , M. Christon , R. Schweitzer , O. M. Lubeck , H. J. Wasserman, Vectorization on Monte Carlo particle transport: an architectural study using the LANL benchmark “GAMTEB”, Proceedings of the 1989 ACM/IEEE conference on Supercomputing, p.10-20, November 12-17, 1989, Reno, Nevada, United States [doi>10.1145/76263.76265]
	5	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	6	W. P. Crowley, C. P. Hendrickson, and T. E. Rudy. The SIMPLE code. UCiD 17715, Lawrence Livermore Laboratory, 1978.
	7	Alan Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-168, December 1989, San Francisco, California, United States [doi>10.1145/96709.96725]
	8	W. L. Harrison, III. The interprocedural analysis and automatic parallelization of scheme programs. Lisp and Symbolic Computation, 2(a/4):179-396, 19$9.
	9	James Edward Hicks, Jr., Compiler-directed storage reclamation using object lifetime analysis, Massachusetts Institute of Technology, Cambridge, MA, 1992
	10	P. Hudak. A semantic model of reference counting and its abstraction. In S. Abramsky and C. Hanldn, editors, Abstract Interpreta. tion of Declarative Languages. 1987.
	11	R. S. Nikhil. Id 90 reference manual. Computation Structures Group Memo 284-1, MIT Laboratory for Computer Science, 1990.
	12	C. Ruggieri , T. P. Murtagh, Lifetime analysis of dynamically allocated objects, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.285-293, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73585]
	13	K. R. Traub, A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE, Massachusetts Institute of Technology, Cambridge, MA, 1986

CITED BY 7

	Ole Agesen , David Detlefs , J. Eliot Moss, Garbage collection and local variable type-precision and liveness in Java virtual machines, ACM SIGPLAN Notices, v.33 n.5, p.269-279, May 1998
	Shail Aditya , Christine H. Flood , James E. Hicks, Garbage collection for strongly-typed languages using run-time type reconstruction, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.12-23, July-Sept. 1994
	Bruno Blanchet, Escape analysis: correctness proof, implementation and experimental results, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.25-37, January 19-21, 1998, San Diego, California, United States
	Radu Rugina , Martin C. Rinard, Pointer analysis for structured parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.70-116, January 2003
	Radu Rugina , Martin Rinard, Pointer analysis for multithreaded programs, ACM SIGPLAN Notices, v.34 n.5, p.77-90, May 1999
	Amir Kamil , Jimmy Su , Katherine Yelick, Making Sequential Consistency Practical in Titanium, Proceedings of the 2005 ACM/IEEE conference on Supercomputing, p.15, November 12-18, 2005
	J. Hammes , S. Sur , W. Böhm, On the effectiveness of functional language features: NAS benchmark FT, Journal of Functional Programming, v.7 n.1, p.103-123, January 1997