Contiguous memory and relational operators

Question

Matlab2010 2013-2-22

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/64552-contiguous-memory-and-relational-operators

I have a 2D matrix of floats called data (approx size 1E5 x 2E2) and wish to test some conditions many times (>1e9 times) eg

data(i:j, h) <= k, where k is a float

This process is a real bottleneck in my code according to the profiler.

I have been reading http://www.mathworks.com/matlabcentral/answers/64457-why-are-relational-operators-so-slow-in-this-case

Here the author (Jan) seems to suggest running permute.m to make the memory contiguous before applying the inequality operator.

I am unclear how to order the permutation though. What have I missed? (or is the permute trick only valid in dimensions above 2?)

tmp = permute(data(i:j, h) , orderVec); %where does orderVec come from???
tmp <= k %this is now fast

2 个评论
显示无隐藏无

James Tursa 2013-2-22

The permute "trick" was mentioned because the other post had : for the trailing dimension. What is your exact situation for subscripting? Is it always of the form (i:j,h) with i, j, and h scalars but changing each iteration?

Matlab2010 2013-3-5

编辑：Matlab2010 2013-3-5

yes thats correct, it is always of the form (i:j,h) with the scalars i, j, and h changing each iteration.

does this help at all?

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Jan 2013-2-22

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/64552-contiguous-memory-and-relational-operators#answer_76159

在 MATLAB Online 中打开

The permute method is useful, when a large multi-dimensional array is indexed repeatedly. In the other thread it was P(M, 4, N) with large M and N. Then calling P(:,i,:) repeatedly consumes much more time than getting Q(:, :, i) after:

Q = permute(P, [1,3,2]);

In your case, the comparison could be performed once only:

comp = (data <= k);

And instead of comparing in a loop, the vector comp(i:j, h) can be used directly. But I assume this is not a dramatic improvement. More precise advices are possible if you post the relevant part of the code.