[Python-3000] Delayed reference counting idea

[Marcin 'Qrczak' Kowalczyk]

Greg Ewing <greg.ewing at canterbury.ac.nz> writes:

>> Incremental GC (e.g. in OCaml) has short pauses. It doesn't scan all
>> memory at once, but distributes the work among GC cycles.
>
> Can it be made to guarantee that no pause will
> be longer than some small amount, such as 20ms?

It's not hard realtime. There are no strict guarantees, and a single
large object is processed in whole.

Python also processes large objects in whole.

-- 
   __("<         Marcin Kowalczyk
   \__/       qrczak at knm.org.pl
    ^^     http://qrnik.knm.org.pl/~qrczak/