Efficient encoding of references into a collection set

Details Efficient encoding of references into a collection set Efficient encoding of references into a collection set

2006-02-14

2006-02-14

Rodriguez, Paul L. (Department: 2123)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

06999979

ABSTRACT:
In a garbage collector that employs the train algorithm, remembered sets are employed to record the locations of references to objects in a train car in objects outside the car. During each collection, remembered set entries are processed to find the locations of references into the cars yet to be collected. The found locations are stored in scratch-pad lists, and each entry in that list includes a mode indicator that specifies whether the entry represents a single reference location or the locations of more than one reference. One possible value of the mode indicator indicates that the entry consists of two computer words rather than one, the second computer word containing a list of offsets into a region specified by the first word. Another possible mode-indicator value indicates that a region contains references, but it does not specify where within the region those references occur.

REFERENCES:
patent: 4797810 (1989-01-01), McEntee et al.
patent: 4912629 (1990-03-01), Shuler, Jr.
patent: 4989134 (1991-01-01), Shaw
patent: 5392432 (1995-02-01), Engelstad et al.
patent: 5845298 (1998-12-01), O'Connor et al.
patent: 5857210 (1999-01-01), Tremblay et al.
patent: 5873105 (1999-02-01), Tremblay et al.
patent: 5900001 (1999-05-01), Wolczko et al.
patent: 5903900 (1999-05-01), Knippel et al.
patent: 5953736 (1999-09-01), O'Connor et al.
patent: 6047125 (2000-04-01), Agesen et al.
patent: 6065020 (2000-05-01), Dussud
patent: 6148310 (2000-11-01), Azagury et al.
patent: 6173294 (2001-01-01), Azagury et al.
patent: 6442661 (2002-08-01), Dreszer
Alain Azagury, “Combining Card Marketing with Rembered Sets: How to Save Scanning Time” Vancouver, British Columbia, Canada, pp. 10-19, 1998, ACM, ISBN:1-58113-114-3.
Jones and Lins, “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” 1996, pp. 165-179, Wiley, New York.
Paul Wilson, “Uniprocessor Garbage Collection Techniques,” Technical Report, University of Texas, 1994, pp. 1-67.
Hudson and Moss, “Incremental Collection of Mature Objects,” Proceedings of International Workshop on Memory Management, 1992, Springer-Verlag, pp. 1-16.
Grarup and Seligmann, “Incremental Mature Garbage Collection,” M.Sc. Thesis, Available at http://www.daimi.au.dk/˜jacobse/Papers/ pp. 1-198.
Seligmann and Grarup, “Incremental Mature Garbage Collection Using the Train Algorithm,” Proceedings of ECOOP '95, Ninth European Conference on Object-Oriented Programming, 1995, http://daimi.au.dk/˜jacobse/Papers/ pp. 1-18.
Clark and Mason, “Compacting Garbage Collection can be Fast and Simple,” Software-Practice and Experience, Feb. 1996, pp. 177-194, vol. 26, No. 2.
Henry Baker, “List Processing in Real Time on a Serial Computer,” Communications of the ACM 21, Apr. 4, 1978, pp. 280-294.
Appel, Ellis, and Li, “Real-time Concurrent Collection on Stock Multiprocessors,” ACM SIGPLAN Notices, 1988, pp. 1-24.
Rodney A. Brooks, “Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardware,” Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, pp. 108-113, Aug. 1984, Austin, Texas.
Herlihy and Moss, “Lock-Free Garbage Collection for Multiprocessors,” ACM SPAA, 1991, pp. 229-236.
Bacon, Attanasio, Lee, Rajan, and Smith, “Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector,” SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, Utah, Jun. 2001, pp. 1-12.
James Stamos, “Static Grouping of Small Objects to Enhance Performance of a Paged Virtual Memory,” ACM Transactions on Computer Systems, vol. 2, No. 2, pp. 155-180, May 1984.
David, A. Moon, “Garbage Collection in a Large Lisp System,” Conference Record of the 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas, Aug. 1984, pp. 235-246.
Robert Courts, “Improving Locality of Reference in a Garbage-Collecting Memory Management System,” Communications of the ACM, Sep. 1988, pp. 1128-1138, vol. 31, No. 9.
Wilson, Lam, and Moher, “Effective Static-Graph Reorganization to Improve Locality in Garbage Collected Systems,” Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun. 1991, Toronto, Ontario, Canada, pp. 1-15.
Lam, Wilson, and Moher, “Object Type Directed Garbage Collection to Improve Locality,” Proceedings of the International Workshop on Memory Management, '92, St. Malo, France, Sep. 1992, pp. 404-425.
Chilimbi and Larus, “Using Generational Garbage Collection to Implement Cache-Conscious Data Placement,” International Symposium on Memory Management, Oct. 1998, pp. 1-12.
Lieberman and Hewitt, “A real-time garbage collector based on the lifetimes of objects,” Communications of the ACM, 1983, pp. 419-429, vol. 26, No. 6.
David Ungar, “Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorthm,” ACM SIGPLAN Notices, Apr. 1984, pp. 157-167, vol. 19, No. 5.
Andrew W. Appel, “Simple Generational Garbage Collection and Fast Allocation,” Software Practice and Experience, 1989, pp. 171-183, vol. 19, No. 2.
Hudson and Diwan, “Adaptive Garbage Collection for Modula-3 and Smalltalk,” in OOPSLA/ECOOP Workshop on Garbage Collection in Object-Oriented Systems, Oct. 1990, Edited by Eric Jul and Niels-Cristial Juul. pp. 1-5.
Hudson and Hosking, “Remembered sets can also play cards,” in OOPSLA/ECOOP Workshop on Garbage Collection in Object-Oriented Systems, Oct. 1993 Edited by Moss, Wilson, and Zorn, pp. 1-8.
Hosking and Moss, “Protection traps and alternatives for memory management of an object-oriented language,” ACM Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles, Dec. 1993, pp. 106-119, vol. 27, No. 5.
Hosking, Moss, and Stefanovic, “A Comparative Performance Evaluation of Write Barrier Implementation,” in OOPSLA ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, Oct. 1992, pp. 92-109, vol. 27, No. 10, ACM SIGPLAN Notices, Vancouver, BC, ACM Press.
Patrick G. Sobalvarro, “A Lifetime-based Garbage Collector for LISP Systems on General-Purpose Computers,” Massachusetts Institute of Technology, AITR-1417, 1988, pp. 1-70.

Affiliated with

Also associated with

Rating

Efficient encoding of references into a collection set does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient encoding of references into a collection set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient encoding of references into a collection set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3681384