Q
Quinnie
Has anyone heard of "stop of the world" algorithms? They are the
garbage collection algorithms. So java runs the garbage collector
concurrently with the users program (the mutator), though, depending
on the implementation it may suspend the mutator when it does most of
its work to avoid invalid heap data...So can you find an algorithm
(like mark and sweep) and consider how to safely run the collector
concurrently, allowing it to do as much work as possible without
suspending the user processor and
what checks need to be added to the user program and how the collector
should proceed. Any help would be so appreciated.
garbage collection algorithms. So java runs the garbage collector
concurrently with the users program (the mutator), though, depending
on the implementation it may suspend the mutator when it does most of
its work to avoid invalid heap data...So can you find an algorithm
(like mark and sweep) and consider how to safely run the collector
concurrently, allowing it to do as much work as possible without
suspending the user processor and
what checks need to be added to the user program and how the collector
should proceed. Any help would be so appreciated.