[Python-3000] Delayed reference counting idea
rhamph at gmail.com
Mon Sep 18 19:11:51 CEST 2006
On 9/18/06, Marcin 'Qrczak' Kowalczyk <qrczak at knm.org.pl> wrote:
> "Adam Olsen" <rhamph at gmail.com> writes:
> > * Bolt-on tracing GC such as Boehm-Demers-Weiser. Totally unsupported
> > by the C standards and changes cache characteristics that CPython has
> > been designed with for years, likely with a very large performance
> > penalty.
> Last time I did some GC benchmarks (unrelated to Python), Boehm GC
> came up surprisingly fast. I suppose it's faster than malloc +
> reference counting (not sure how much amortizing malloc calls helps).
I expect Boehm would do very well in applications suited for it. I
just don't think that includes CPython, especially with all the
third-party C libraries.
Adam Olsen, aka Rhamphoryncus
More information about the Python-3000