All,
Great presentation by Joseph this week on arrays. This is my addition to the section covered on FIFOs. It makes a difference on how you write your code on how efficient they will run. See the attached example code.
Matt
Based on 10,000,000 loops, FIFO 20 elements, Update percentage counter every 1,000 loops
Insert With No Delete
Time = Greater than hour.
Bad, no FIFO, and no limit on memory usage. This causes slow performance and a memory leak.
Insert Then Delete Array Element
Time = 9.589 seconds
Better, will FIFO data, and will limit memory usage. Slower performance due to memory reallocation for every loop executed.
Initialize, Rotate, Then Replace Array Element
Time = 4.468 Seconds
Best, will FIFO data, and will limit memory usage. Optimal performance because no memory needs to be allocated / deallocated
Matt Fitzsimons
NI Alliance Member
LabVIEW Champion
NI Certified LabVIEW Architect
LabVIEW, LV-RT, Vision, DAQ, Motion, and FPGA
