Hi David
I tried to add this comment to your post on blogs.perl.org but there seems
to be something wrong with the site, my browser cookies, whatever I cannot
submit. Here it is via e-mail. We still have the PDL mailing lists (
http://pdl.perl.org/?page=mailing-lists) for general or specific PDL
discussion. Hope things are well.
--Chris
Hi David, nice to see work again on C::Blocks. The mandelbrot algorithm is
> likely a pathological case for PDL-2.015 for a number of reasons:
>
> (1) PDL computations are basically memory to memory without things like
> register operations and often the cache is broken for large data,
>
> (2) even the optimized algorithms appear to have a large number of PDL
> creation operations---very expensive,
>
> (3) PDL can be very efficient in compute and memory for *uniform*
> computations but here the memory breaks the cache and introduces page
> faults.
>
> One way to get comparable performance with the current PDL implementation
> is pretty much the same way you've done in C::Blocks---implement a tight
> loop that is operation and memory efficient. (Hint: See the documentation
> for PDL::PP)
>
>
------------------------------------------------------------------------------
Find and fix application performance issues faster with Applications Manager
Applications Manager provides deep performance insights into multiple tiers of
your business applications. It resolves application problems quickly and
reduces your MTTR. Get your free trial!
https://ad.doubleclick.net/ddm/clk/302982198;130105516;z
_______________________________________________
pdl-general mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/pdl-general
