Re: ANN: Storage pool for Ada 2005 with bindings to Apache Runtime Pools library

[Brad Moore <brad.moore@shaw.ca>]

On 24/03/2011 9:59 AM, Brian Drummond wrote:
> Great work, and certainly blows the doors off my puny efforts!
>
> You may be right about tuning the number of threads; on my (AMD Phenom)
> system, my version (#3) gave the same runtime for 4 or 8 tasks, but on
> the test system (Intel Q6600) 8 tasks was about 10% slower than 4. (The
> memory footprint was doubled, suggesting memory or cache limitations on
> the Intel system).
>
> It may be worth posting the Deepend version - either there, or is there a
> place on Rosetta for it? - as a demonstration of the flexibility of Ada's
> storage pools.
>
> - Brian

Thanks for your version also, In particular, the output generation from 
your version saved me from having to fiddle around with getting the 
output to come out right.

I actually set the number of workers to 5, which was a bit surprising to 
me. I believe there are 9 iterations, which is why the number
of workers doesnt come out to an even number. On my system, an AMD
Quadcore, 5 workers gave me the best time. I was thinking 9 would
have been the best number.

It may be that 4 is a better number on their machine. I should maybe
ask the maintainers of the benchmarks to try running with 4 to see if
that runs any better.

I was thought about posting the Deepend version, (there are actually two
versions, one that uses nested access types that relies on Ada's ability
to clean up objects when access types get finalized, using the new 
operator, and the second version that uses calls to Deepend's generic
allocate procedure that lets you use a single access type with different 
pool objects. The reason I decided against posting the result was more 
that the one that was there involves less source code, and might be 
better for language comparisons.

I'm not aware of Rosetta. I'll see if I can find that site.

Thanks,
Brad