[Numpy-discussion] Z-ordering (Morton ordering) for numpy
Charles R Harris
charlesr.harris at gmail.com
Sat Nov 24 18:04:53 EST 2012
On Sat, Nov 24, 2012 at 1:30 PM, Gamblin, Todd <gamblin2 at llnl.gov> wrote:
> So, just FYI, my usage of this is for Rubik, where it's a communication
> latency optimization for the code being mapped to the network. I haven't
> tested it as an optimization for particular in-core algorithms. However,
> there was some work on this at LLNL maybe a couple years ago -- I think it
> was for the solvers. I'll ask around for an example and/or a paper, or
> maybe Travis has examples.
> Just from an ease-of-use point of view, though, if you make it simple to
> do zordering, you might see more people using it :). That's why I wanted
> to get this into numpy.
> This brings up another point. This is pure python, so it won't be
> super-fast. What's the typical way things are integrated and optimized in
> numpy? Do you contribute something like this in python first then convert
> to cython/C as necessary? Or would you want it in C to begin with?
I think Python is a good start as it allows easy modification and can be
converted to Cython later on. OTOH, if the new function looks settled from
the get go, Cython is an option.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NumPy-Discussion