Lines Matching full:algorithms
112 use of compacting and generational GC algorithms) and it can occasionally suffer
350 <p>Unlike many GC algorithms which rely on a cooperative code generator to
414 programs that use different garbage collection algorithms (or none at all).</p>
551 <p>Many important algorithms require write barriers, including generational
573 <p>Read barriers are needed by fewer algorithms than write barriers, and may
598 algorithms. For an uncontroversial collector, all that remains may be to
677 may do useful work. Some of these are callbacks, some are algorithms that can
947 extent. Sophisticated marking algorithms are necessary. Read barriers may
