A “card-marking” scheme for controlling intergenerational references in generation-based garbage collection on stock hardware

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A “card-marking” scheme for controlling intergenerational references in generation-based garbage collection on stock hardware

Full text

Pdf (506 KB)

Source

ACM SIGPLAN Notices archive
Volume 24 , Issue 5 (May 1989) table of contents

Pages: 87 - 92

Year of Publication: 1989

ISSN:0362-1340

Authors

P. R. Wilson	Electrical Engineering and Computer Science Dept., University of Illinois at Chicago, Box 4348 (m/c 154) Chicago, Illinois
T. G. Moher	Electrical Engineering and Computer Science Dept., University of Illinois at Chicago, Box 4348 (m/c 154) Chicago, Illinois

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 45, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/66068.66077 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	A. W. Appel , J. R. Ellis , K. Li, Real-time concurrent collection on stock multiprocessors, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.11-20, June 20-24, 1988, Atlanta, Georgia, United States
	2	Ricki Blau, Paging on an object-oriented personal computer, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.44-54, August 29-31, 1983, Minneapolis, Minnesota, United States [doi>10.1145/800040.801394]
	3	Daniel G. Bobrow , Jerry D. Burchfiel , Daniel L. Murphy , Raymond S. Tomlinson, TENEX, a paged time sharing system for the PDP - 10, Communications of the ACM, v.15 n.3, p.135-143, March 1972 [doi>10.1145/361268.361271]
	4	Patrick J. Caudill , Allen Wirfs-Brock, A third generation Smalltalk-80 implementation, Conference proceedings on Object-oriented programming systems, languages and applications, p.119-130, September 29-October 02, 1986, Portland, Oregon, United States
	5	Stuart I. Feldman , Channing B. Brown, IGOR: a system for program debugging via reversible execution, Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging, p.112-123, May 05-06, 1988, Madison, Wisconsin, United States
	6	Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983 [doi>10.1145/358141.358147]
	7	Sanja Mittal , Daniel G. Bobrow , Kenneth M. Kahn, Virtual copies: at the boundary between classes and instances, Conference proceedings on Object-oriented programming systems, languages and applications, p.159-166, September 29-October 02, 1986, Portland, Oregon, United States
	8	Mill87 Miller, James S., "MultiScheme: a parallel processing system based on MIT Scheme," Ph.D. Dissertation, Massachussetts Institute of Technology, September 1987, MIT/LCS/TR-402.
	9	David A. Moon, Garbage collection in a large LISP system, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.235-246, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802040]
	10	Richard Rashid , Avadis Tevanian , Michael Young , David Golub , Robert Baron, Machine-independent virtual memory management for paged uniprocessor and multiprocessor architectures, Proceedings of the second international conference on Architectual support for programming languages and operating systems, p.31-39, October 1987, Palo Alto, California, United States
	11	Robert Allen Shaw, Empirical analysis of a LISP system, Stanford University, Stanford, CA, 1988
	12	SmMa89 Smith, Jonathan, and Gerald Q. Maguire "Transparent concurrent execution of mutually exclusive alternatives," to appear in Proceedings of the Ninth Annual Conference on Distributed Computing Systems, Newport Beach, California, June 1989. Also available as Columbia University Computer Science Dept. Technical Report CUCS-387-88.
	13	Soba88 Sobalvarro, Patrick G., "A lifetime-based garbage collector for LISP systems on general-purpose computers," B.S. thesis, MIT EECS Dept. 1988.
	14	James W. Stamos, Static grouping of small objects to enhance performance of a paged virtual memory, ACM Transactions on Computer Systems (TOCS), v.2 n.2, p.155-180, May 1984 [doi>10.1145/190.194]
	15	David Ungar, Generation Scavenging: A non-disruptive high performance storage reclamation algorithm, ACM SIGPLAN Notices, v.19 n.5, p.157-167, May 1984
	16	David Ungar , Frank Jackson, Tenuring policies for generation-based storage reclamation, Conference proceedings on Object-oriented programming systems, languages and applications, p.1-17, September 25-30, 1988, San Diego, California, United States
	17	Wils88 Wilson, Paul R. "Two comprehensive virtual copy mechanisms." M.S. thesis, University of Illinois at Chicago EECS Dept., 1988.
	18	P. R. Wilson, Opportunistic garbage collection, ACM SIGPLAN Notices, v.23 n.12, p.98-102, Dec. 1988 [doi>10.1145/57669.57679]
	19	P. R. Wilson, A simple bucket-brigade advancement mechanism for generation-bases garbage collection, ACM SIGPLAN Notices, v.24 n.5, p.38-46, May 1989 [doi>10.1145/66068.66070]
	20	Wils89b Wilson, Paul R., and Thomas G. Moher "Scavenging algorithms for improved locality," working paper, University of Illinois at Chicago EECS Department.
	21	P. R. Wilson , T. G. Moher, Demonic memory for process histories, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.330-343, June 19-23, 1989, Portland, Oregon, United States

CITED BY 9

	Daniel J. Scales , Kourosh Gharachorloo , Chandramohan A. Thekkath, Shasta: a low overhead, software-only approach for supporting fine-grain shared memory, ACM SIGOPS Operating Systems Review, v.30 n.5, p.174-185, Dec. 1996
	Stephen M Blackburn , Kathryn S. McKinley, In or out?: putting write barriers in their place, ACM SIGPLAN Notices, v.38 n.2 supplement, February 2003
	Darko Stefanović , Kathryn S. McKinley , J. Eliot B. Moss, Age-based garbage collection, ACM SIGPLAN Notices, v.34 n.10, p.370-381, Oct. 1999
	Stephen M Blackburn , Richard Jones , Kathryn S. McKinley , J Eliot B Moss, Beltway: getting around garbage collection gridlock, ACM SIGPLAN Notices, v.37 n.5, May 2002
	Alain Azagury , Elliot K. Kolodner , Erez Petrank , Zvi Yehudai, Combining card marking with remembered sets: how to save scanning time, ACM SIGPLAN Notices, v.34 n.3, p.10-19, March 1999
	P. R. Wilson , T. G. Moher, Demonic memory for process histories, ACM SIGPLAN Notices, v.24 n.7, p.330-343, July 1989
	Stephen M. Blackburn , Antony L. Hosking, Barriers: friend or foe?, Proceedings of the 4th international symposium on Memory management, October 24-25, 2004, Vancouver, BC, Canada
	David Detlefs , Ross Knippel , William D. Clinger , Matthias Jacob, Concurrent Remembered Set Refinement in Generational Garbage Collection, Proceedings of the 2nd Java™ Virtual Machine Research and Technology Symposium, p.13-26, August 01-02, 2002
	Michal Wegiel , Chandra Krintz, XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination, ACM SIGPLAN Notices, v.43 n.6, June 2008