in reply to Re^12: Optimizing with Caching vs. Parallelizing (MCE::Map) (PDL: faster)
in thread Optimizing with Caching vs. Parallelizing (MCE::Map)

Greetings, etj. My initial post was simply heads up with regards to slowness detected. I left the test code for you; or if you like, for the PDL team. If you haven't already, you'd find interesting things using Devel::NYTProf. A lot of subroutines are noticeably slower compared to PDL 2.021. The test script provides a starting point.

  • Comment on Re^13: Optimizing with Caching vs. Parallelizing (MCE::Map) (PDL: faster)

Replies are listed 'Best First'.
Re^14: Optimizing with Caching vs. Parallelizing (MCE::Map) (PDL: faster)
by etj (Priest) on May 22, 2022 at 00:47 UTC
    "A lot of" - can you help me by naming one of them, and saying what data it was run on? I hope you can see that would make your observation even more helpful.

    For those interested in why I'm not digging into this instantly, it's because the PDL::OpenCV work is nearly done, apart from generating a C wrapper per OpenCV submodule - I can only do (at most, and on a good day) one thing at a time ;-)

      Tools to actually help with this problem visible at Re^2: profiling XS routines. (edited as requested; one person said a hyperlink to https://perlmonks.org/?node_id=11144333 logs people out, which seems unlikely - however there are 6 different sites, and an id://blah link is canonically correct whichever one you're on, instead of linking to the wrong site)

      I was hoping that a member of the PDL team can view the graph and compare between PDL 2.021 and recent.