End of function slow - Matlab Profiler

8 次查看（过去 30 天）
Vince
Vince 2013-7-25
评论： Are Mjaavatten 2018-9-5
Hi,
I'm trying to optimize my program, and I'm encountering very curious results with the Profiler. It seems that the end statement in a function is taking significantly longer than any other statement.
Below is an image from the profiler output.
ks is a 1D vector, realKa is a boolean, and everything else is just a scalar.
As you can see, end takes up more time than the two most computationally intensive lines 190 and 198 combined. Why is this?
Note: I'm quite sure it is not because of the profiler, because the profiler said the total time spent in this function was 5.252 seconds, while adding up all the times and rounding up yields 2.47 seconds. Running my program without the profiler speeds things up by close to the difference of 2.782 seconds.
  2 个评论
Muthu Annamalai
Muthu Annamalai 2013-7-25
According to your profiling results, ~ 1/3 of the calls to err() function do not enter the loop. Also I wonder if having function name, variable name, and the return value set to the same identifier has something to do with it.
I'd be more creative and use different names, assuming there isn't a shortage where you live :-)
Vince
Vince 2013-7-25
@Muthu There is no loop; it is an if-else statement. ~1/3 goes into the if, and ~2/3 goes to the else.
I tried renaming the variables and function, and it made no impact on the runtime. :/ That was a good point though.

请先登录，再进行评论。

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

采纳的回答

Richard Brown
Richard Brown 2013-7-25
Pretty sure you'll find it's the overhead for the function call
  2 个评论
Vince
Vince 2013-7-25
Is there an easy way to reduce the overhead? I guess it wouldn't be too difficult to build a mex function out of this...
Are Mjaavatten
Are Mjaavatten 2018-9-5
I ran into the same problem today, with the following function:
function [X,R] = triples(L)
% Return all pythagorean triples with total side length L
X = [];
cmin = floor(L/(1+sqrt(2)));
cmax = ceil((L-1)/2);
for c = cmin:cmax
b = round(real(0.5*(L-c+sqrt(2*L*c+c^2-L^2))));
a = L-b-c;
if a>0 && a^2+b^2 == c^2
X = [X;[a,b,c]];
end
end
end
Running the commands
tic;for i = 1:1000;triples(5000);end;toc
takes 0.505 seconds on my PC, using Matlab 2014b. Now, cmin is actually one too low, making the expression inside the sqrt function negative for c = cmin, which explains why I need to take the real part to avoid errors. However, if I increase cmin by one, the time goes up to 0.57 seconds. Similar differences show up for most values of L.
In the latter case, the profiler allocates much time to the end statement for the for loop. In the first case the end statement takes very little time. I think this supports the suggestion by Jan in his answer to this queation that it has to do with the JIT compilation. This is supported by the fact that in Matlab2012b, things are more as I would expect, with the narrower range version executing slightly faster.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Common Operations 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by