Dr. Damien's Development - Memory Allocation in Loops

[battler.]

---

altenbach wrote:

This is one of my standard templates. You can find many instances here in the forum. 😄

---

Searching for those standard templates.  Does anybody (everybody) actually use these methods?  Are there replacement subVIs?

[F._Schubert]

I always thought that the inner workings of LV already implement the algorithm of ManagedAddItems.vi (doubling the allocated memory each time we run out of it).

That 'knownledge' is based on my early beginnings using LV 5.

Felix

[battler.]

They don't and it's the delete elements which is more time consuming.

Are there some standard VIs ppl use to implement the techniques discussed?

[setu_mohta]

The "Filter 1D Array" function in the OpenG library does not use this technique either... it is comparable in performance to the 'SimpleRemoveItems.vi'

[altenbach]

It was pointed out in 2007 that the openG version of "delete elements from array" is slow and inefficient. I wonder if it ever got improved... See here for details (read the entire thread for my even better code!)

[crossrulz]

Here's an even more up-to-date thread about the OpenG Array functions.  There were a bunch of updates proposed to make them faster.  I'm not sure what the status is on getting the library released though.

http://lavag.org/topic/15980-openg-filter-array-revised/

[Bap2703]

As you upped this thread I tried the same benchmark with the conditional tunnel.

Here are my results.

Bucket: 11 ms

LV2012 conditional tunnel : 87 ms

Managed: 107 ms

SimpleAdd: 179 ms

SimpleRemove: 8330 ms