From: Daniel Armyr on 4 May 2010 05:37 Hi. For the last couple of years now, I have been running an algorithm that I coded in java from inside matlab. It takes two matrices of up to 1000x1000 elements and returns a java object containing three matrices of approximately 100x100 elements each. Yesterday I was in a debate about the efficiency of my algorithm and went back to test it more carefully. I was astonished to find that there is an overhead of almost 160ms for each call to my java function. Is there a reason for this overhead? I have come to understand (from my collegues benchmarking of his competing mex-implementation) that the overhead when calling a mex file is insignificant compared to this? Any thoughts on that? Sincerely Daniel Armyr.
|
Pages: 1 Prev: ARX modeling inaccurate Next: How to put the image in to GUI! |