Re: [TCLCORE] Re: Hintermayer's string allocation patch

[Gerhard H. <g.h...@in...>]

Andreas Kupries wrote:
> 
> Hi, my two cents or so in this.
> 
> I go with George and John here, i.e. allocate until you the wall and
> then retract from the boundary to fill the rest in smaller
> increments.
> 
> What I like about this algorithm is that it not only preserves maximum
> performance for as long as possible while still being able to fill the
> memory to the max. but also that it is "self-tuning".
> 
> With this I mean that there is no need to adjust (tinker / fiddle
> with) some parameters like with the current patch proposed as by
> Gerhard to adapt the core to the host it is running on to get good
> performance on average. We get this automatically.
> 
> This makes it also easier for distributors of binaries. No need to
> guess some values for the parameters which will give good performance
> over a __range_of_machines__.
> 
> Gerhard, are you willing to try and write a second patch which uses
> this algorithm to solve the problem so that we may compare hard
> numbers instead of running in argumentative circles without hard data ?
> 

Well, I'm sorry, no. I do not have that much spare time and besides the
discussion I started by submitting this patch was a bit frustrating.
Ok, the patch is not the best solution, but I think it was worth
spending the time, I looked for a quick solution and didn't want to
rewrite the whole memory handling. Of course there are better
implementations, but that would require more time and maybe expertise,
which I don't have.
Maybe someone from the core team can do this.
It is a pity, that this discussion consumed more of my time than
actually writing the patch.

Gerhard
-- 
Gerhard Hintermayer
http://www.inode.at/g.hintermayer