Implementing Multiple Memory Orders #38
Replies: 3 comments 1 reply
-
| I have implemented a Column major ('F') NDArray before switching to our current Row major ('C') NDArray, so it won't take long to implement the column major arrays. My thoughts:
 Proposal for v0.1
 Proposal for v0.1 onwards
 | 
Beta Was this translation helpful? Give feedback.
-
| Here is an example when I incorporated the  The test uses two matrices: A 200x100 and B 100x 200, both saved in both "C" and "F" order. They are multiplied 10000 times to get the execution time, using both   | 
Beta Was this translation helpful? Give feedback.
-
| 
 I do not think that a matched order is needed. Actually CxF is an efficient way of doing multiplication to exploit the continuous memory allocation. The order information will be eventually reflected on the stride info. 
 I agree with this. Making the order known at compiled time is good. We can also add a function to change the order of an array. 
 It is good idea. Maybe we can also look into numpy and see how they differentiate the two orders. | 
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
If we want to match features from numpy, and ensure wide interoperability, we need to implement at least C and F ordering.
Problems:
Proposed Solution
Benefits:
Downsides:
I think we should wait until after v0.1 to implement multiple memory ordering.
Thoughts, on the proposal, any other ideas?
Beta Was this translation helpful? Give feedback.
All reactions