Garbage collector employing multiple-car collection sets

Abstract

During at least some collection intervals, a garbage collector that employs the train algorithm for collection of a heap generation collects more than one car section. By thus varying the size of the collection set, the collector is able to respond to varying conditions with more flexibility than it could if it collected only a single car section in any interval. When the collector searches for references in portions of a generation identified by an entry in a given car section's remembered set, it searches not only for references to objects in that car section but also to references for objects in other collection-set car sections. This increases scanning efficiency.

1 . A method of garbage collection in accordance with the train algorithm comprising: 
 A) treating a generation of a collected heap as being organized into car sections;    B) assigning space in the heap containing, objects to respective trains in units of car sections; and    C) collecting the generation incrementally during collection intervals in at least some of which more than a single car section is collected.