-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Sep 18, 2006, at 12:27 PM, Marcin 'Qrczak' Kowalczyk wrote:
> "Adam Olsen" <[EMAIL PROTECTED]> 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 don't like the idea of a conservative GC at all in general, but > Boehm GC seems to have very good quality, and it's easy to use from > the point of view of a C API. What worries me is the unpredictability of gc vs. refcounting. For some class of Python applications it's important that when an object is dereferenced it really goes away right then. I /like/ reference counting! - -Barry -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.5 (Darwin) iQCVAwUBRQ7aCHEjvBPtnXfVAQLziwP+K/lepARPfrRtGoH/7HTUE6oXL+4kF5Ow fEmg7zRPL3p8vrPrdKZi63kW4pZWYbmlsb/ugF+WmSdJIYebdK/p5d4kq5uOcWKi 9qVLtVXo6/f/nsNEeN0pcX/Y5RTRXPSgMy7hwlDH7/x4gT+Rz6uZSCR1I02x5OHa wN4+KiInPSw= =ScRh -----END PGP SIGNATURE----- _______________________________________________ Python-3000 mailing list [email protected] http://mail.python.org/mailman/listinfo/python-3000 Unsubscribe: http://mail.python.org/mailman/options/python-3000/archive%40mail-archive.com
