I was wondering is there an efficient way of moving data around that is separated by long strides?
In particular I am dealing with a 2D array. Once I perform the operation on the quick dimension (across in strides of 1) I then have to move down the array (in my case floats separated by a stride of 1024 (4096 bytes)). At this point my app is bottlenecking shuffling the data to stride 1 before sending it to the next function for processing.
Any tricks or suggestions or is this just one of those things you have to deal with?
Similarly is it more efficient time wise to do the shuffling all at once (essentially rotating the array 90 degrees) or doing it by converting one column to a row, one at a time? Or is there no difference?
Thanks in advance!
Dave
David W. Gohara, Ph.D.
Harvard Medical School http://www.scianafilms.com
617-432-1216 (p)
617-432-4360 (f)
_______________________________________________
Do not post admin requests to the list. They will be ignored.
PerfOptimization-dev mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/perfoptimization-dev/email@hidden
This email sent to email@hidden
