Method for combining card marking with remembered set for generational garbage collection with more than two generations

作者: Erez Petrank , Alain Azagury , Zvi Yehudai , Elliot K. Kolodner

DOI:

关键词:

摘要: A system for garbage collection of memory objects in a heap. The includes heap that is partitioned into few generations, each generation being cards. generations are associated with remembered sets and card markings data structure. Each the structure scan related represent which has or not to be scanned. further processor communicating scanning cards according data, response identifying updated inter-generational pointers, capable updating remember set identified pointers. data.

参考文章(12)
Antony L. Hosking, Richard L. Hudson, Remembered sets can also play cards ,(1999)
Jacob Seligmann, Steffen Grarup, Incremental Mature Garbage Collection Using the Train Algorithm european conference on object oriented programming. pp. 235- 252 ,(1995) , 10.1007/3-540-49538-X_12
Paul R. Wilson, Uniprocessor garbage collection techniques Memory Management. pp. 1- 42 ,(1992) , 10.1007/BFB0017182
Rafael Lins, Richard Jones, Garbage collection: algorithms for automatic dynamic memory management John Wiley & Sons, Inc.. ,(1996)
Richard L. Hudson, J. Eliot B. Moss, Incremental collection of mature objects Memory Management. pp. 388- 403 ,(1992) , 10.1007/BFB0017203
Henry Lieberman, Carl Hewitt, A real-time garbage collector based on the lifetimes of objects Communications of the ACM. ,vol. 26, pp. 419- 429 ,(1983) , 10.1145/358141.358147
David Ungar, Generation Scavenging ACM SIGSOFT Software Engineering Notes. ,vol. 9, pp. 157- 167 ,(1984) , 10.1145/390010.808261