The expected complexity for completely draining a long list
can be reduced from quadratic to linear time when the
contention is low. The current code causes quadratic
complexity even when there is no contention for the overflow list.
Should check other collectors to see if the same problem
exists in any of the other collectors (in particular ParNew
which also uses overflow lists in somewhat similar fashion).