[Python-3000] Delayed reference counting idea
barry at python.org
Tue Sep 19 18:10:35 CEST 2006
-----BEGIN PGP SIGNED MESSAGE-----
On Sep 19, 2006, at 12:05 PM, Brian Quinlan wrote:
> Marcin 'Qrczak' Kowalczyk wrote:
>> Brian Quinlan <brian at sweetapp.com> writes:
>>>> Reference counting is inefficient, doesn't by itself handle cycles,
>>>> and is impractical to combine with threads which run in
>>>> parallel. The
>>>> general consensus of modern language implementations is that a
>>>> GC is the future.
>>> How is reference counting inefficient?
> Do somehow know that tracing GC would be more efficient for typical
> python programs or are you just speculating?
Also, what does "efficient" mean here? Overall program run time? No
user-discernible pauses in operation? Stinginess in overall memory use?
There are a lot of different efficiency parameters to consider, and
of course different applications will care more about some than
others. A u/i-based tool doesn't want noticeable pauses. A long
running daemon wants manageable and predictable memory utilization.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (Darwin)
-----END PGP SIGNATURE-----
More information about the Python-3000