Can you give a more detailed explanation about this algorithm? It seems that it boils down to "Give the process twice the heap and it spends half the time garb

Can you give a more detailed explanation about this algorithm? It seems that it boils down to "Give the process twice the heap and it spends half the time garbage collecting?" Looking at the graphs, the old garbage collector didn't tend to expand without bound, it clearly had a smaller max size than the new one. In addition, the old GC was pretty near the "knee" of the curve, if you allocate less memory GC time goes up, if you allocate more memory GC time goes down. I'm seeing that you get about 20% improvement at the center, at the expense of twice the delay or twice the memory at the ends. Please correct me if I'm misinterpreting this?