Memory allocation when using permutedims

[abraemer]

Note there is a difference between reshaping and permuting the dimensions: Reshaping keeps the same “order” of the data and permuting axes does not. Standard arrays in Julia are always “contiguous” meaning their data is in the order corresponding to the indices.

What you are looking for is a lazy version of permutedims. I am not sure whether there is a “canonical” package for this but there is an implementation in Base called PermutedDimsArray and I found transmute from TransmuteDims.jl. Just understand that you make a tradeoff here: You save memory by not copying the array but will likely lose performance when you keep working with the lazily permuted array. For reference:

PermutedDimsArray slower than permutedims?

I’m struggling to understand why one function for multiplying a batch of matrices with a single matrix is significantly slower than another. The only difference between the functions is that PermutedDimsArray is used in place of permutedims in the slower function. I would have thought permutedims would be slower given that it creates a copy of the array while PermutedDimsArray creates a new view. This makes me think I’ve misunderstood something fundamental with how Julia works. function batche…

Two other ideas:

• Maybe you can keep track of the permutation elsewhere and use this information in your code
• there is permutedims! which copies the permuted array to a different location in memory. So if you can afford to allocate a temporay array once and keep it around, then you can perform all the permutedims you want and keep the arrays contiguous.