Allocation-Phase Aware Thread Scheduling Policies to Improve Garbage Collection Performance

One way to sustain good garbage collection efficiency is to have a large enough heap to allow many allocation phases to complete and most of the objects to die before invoking garbage collection. However, such an operating environment is hard to maintain in large multithreaded applications because most typical time-sharing schedulers are not allocation-phase cognizant; i.e., they often schedule threads in a way that prevents them from completing their allocation phases quickly. Thus, when garbage collection is invoked, most allocation phases have yet to be completed, resulting in poor collection efficiency.

Provided by: Association for Computing Machinery Topic: Hardware Date Added: Oct 2007 Format: PDF

Find By Topic