Performance of state machine with enum vs string?

[rbrown_acertaralabs]

Indeed I am surprised with debugging disabled!  Both cases now clock in at exactly 15.6ms to run the entire VI -- I had to use the Profiler to get any numbers back at all since disabled debugging produced much faster performance.  Additionally, I bumped up the iterations to 2E9.  So the 15.6ms is for 10x 2E9 iterations, and it is 15.6ms for both string and enum selectors, which is odd.  Perhaps this is the minimum measurable execution time for this scenario.  Another possibility is that the no-debug optimization sees no code inside the case structures and simply optimizes it out.  I think the next test is to include identical non-optimizable code inside each case to ensure code is not optimized out.  The plot thickens...

[rbrown_acertaralabs]

🙂   Just saw your post after I was theorizing that the code is being optimized out...good to get confirmation from your input about code folding!  Thank you!

[mcduff]

Using Sir Crossrulz's suggestion, wire output to a control, I used last value and did not wire all cases, I did not see a big difference between the two cases.

Mmm, where is Altenbach, he is the Knight of Benchmarking??

mcduff

[JÞB]

For a random integer array without dup's use riffle vi riffled index out. With an array size in equal to the desired values. Who cares what the array element values are the indexes out will be 0  - n-1 in a gaussian distribution.

Also try hires rel seconds for better snr on timing.

Nice work

[Bob_Schor]

---

@JÞB wrote:

For a random integer array without dup's use riffle vi riffled index out. With an array size in equal to the desired values. Who cares what the array element values are the indexes out will be 0  - n-1 in a gaussian distribution.

---

First, I picked up on "Gaussian Distribution" (also known as the Normal Distribution) -- did you mean Uniform Distribution?  Then I tried to figure out what you meant as the algorithm, and figured it out, but, boy, how arcane!

Bob "Picky" Schor

[JÞB]

---

@Bob_Schor wrote:

---

@JÞB wrote:

For a random integer array without dup's use riffle vi riffled index out. With an array size in equal to the desired values. Who cares what the array element values are the indexes out will be 0  - n-1 in a gaussian distribution.

---

First, I picked up on "Gaussian Distribution" (also known as the Normal Distribution) -- did you mean Uniform Distribution?  Then I tried to figure out what you meant as the algorithm, and figured it out, but, boy, how arcane!

Bob "Picky" Schor

Sometimes I learn a thing or two about here.  Dr. K tipped me off a while ago.  Too bad he is not able to keep up with us.

---