Write barrier system and method for trapping garbage collection

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707103, 707104, 711100, 711103, 395676, G06F 1730

Patent

active

058452982

ABSTRACT:
Architectural support is provided for trapping of garbage collection page boundary crossing pointer stores. Identification of pointer stores as boundary crossing is performed by a store barrier responsive to a garbage collection page mask that is programmably encoded to define a garbage collection page size. The write barrier and garbage collection page mask provide a programmably-flexible definition of garbage collection page size and therefore of boundary crossing pointer stores to be trapped, affording a garbage collector implementer with support for a wide variety of generational garbage collection methods, including train algorithm type methods to managing mature portions of a generationally collected memory space. Pointer specific store instruction replacement allows implementations that provide an exact barrier not only to pointer stores, but more particularly to pointer stores crossing programmably defined garbage collection page boundaries.

REFERENCES:
patent: 4775932 (1988-10-01), Oxley et al.
patent: 4907151 (1990-03-01), Bartlett
patent: 4922414 (1990-05-01), Holloway et al.
patent: 4989134 (1991-01-01), Shaw
patent: 5088036 (1992-02-01), Ellis et al.
patent: 5136706 (1992-08-01), Courts
patent: 5218698 (1993-06-01), Mandl
patent: 5321834 (1994-06-01), Weiser et al.
patent: 5367685 (1994-11-01), Gosling
patent: 5560003 (1996-09-01), Nilsen et al.
Richard Jones and Rafael Lins, Garbage Collection: Algorithms for Automatic Dynamic Memory Management, Feb. 1997, John Wiley & Sons, entire work (previously supplied copy on reserve in the EIC library) and more particulary pp. 1-41 and 116-226 (copies enclosed).
David A. Barrett, Thesis entitled: Improving the Performance of Conservative Generational Garbage Collection, Technical Report CU-CS-784-95, Sep. 1995, pp. 1-64.
Robert Courts, Improving Locality of Reference in a Garbage-Collecting Memory Management System, Communications of the ACM, Sep. 1988, vol. 31, No. 9, pp. 1128-1138.
David A. Moon, Garbage Collection in a Large Lisp System, 1984, pp. 235-246.
Urs Holzle, A Fast Write Barrier for Generational Garbage Collectors, OOPSLA '93 Garbage Collection Workshop, Oct. 1993, pp. 1-6.
David A. Moon, Architecture of the Symbolics 3600, IEEE, 1985, pp. 76-83.
Henry G. Baker, Jr., List Processing in Real Time on a Serial Computer, Comm. ACM, Apr. 1978, vol. 21, No. 4, pp. 280-294.
David Ungar, Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm, ACM SIGPLAN Notices, May 1984, vol. 19, No. 5, pp. 157-167.
Guy L. Steele, Jr., Multiprocessing Compactifying Garbage Collection, Comm. ACM, Sep. 1975, vol. 18, No. 9, pp. 495-508.
Paul R. Wilson and Thomas G. Moher, Design of the Opportunistic Garbage Collector, OOPSLA '89 Proceedings, Oct. 1989, pp. 23-25.
Mario Wolczko and Ifor Williams, Multi-level Garbage Collection in a High-Performance Persistent Object System, Proceedings of the Fifth International Workshop on Persistent Object Systems, Sep. 1992, pp. 396-418.
Richard L. Hudson and J. Eliot B. Moss, Incremental Collection of Mature Objects, International Workshop IWMM 92, Sep. 1992, pp. 388-403.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Write barrier system and method for trapping garbage collection does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Write barrier system and method for trapping garbage collection , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Write barrier system and method for trapping garbage collection will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2403596

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.