| 摘要 |
In a garbage collector that employs the train algorithm, the collector identifies cars that are located far back in the collection order but already have large remembered sets, and it advances their collection. One way of doing so includes advancing a car's nominal position in the collection order, placing it nominally ahead of erstwhile "older" cars as well as actually. Another way does not include changing the advanced car's nominal position. The advancement operation is simpler with the latter approach, but normal updating is simpler with the former. Although both approaches tend to increase the number of entries in the remembered set of the car thus advanced, they actually reduce the overall memory cost of remembered-set maintenance.
|
