From: Peter Dimov (pdimov_at_[hidden])
Date: 2003-08-26 13:15:11
Andreas Huber wrote:
> Peter Dimov wrote:
>> The usual approach is to borrow an entry from the 2*N heap and split
>> it in two when the N heap is empty. [snip]
> Which brings back non-determinism, as the 2*N heap could be full also
> and thus be borrowing from 4*N already. You can of course guarantee
> an upper limit for an allocation, as some heap must have a slot
Actually it's possible that all free memory already went to the N/2 heap but
this case is (even more) unsolvable with predetermined heap sizes, too. :-)
> However, for some systems this upper limit is already too slow, so
> someone inevitably has to configure heap sizes *before* startup.
I agree, but I still don't see why a quality system allocator on such a
system should not give you the ability to do so.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk