Grampa_of_Oliva_n_Eden

QUOTE (Gary Rubin @ May 1 2009, 11:27 AM) I was just grasping at straws to explain the apperent interaction when they run in parallel. Calls to the OS memory manager is just a guess at how the two loops could slow each other down when run at the same time. Ben

QUOTE (Gary Rubin @ May 1 2009, 11:12 AM) Ok still wandering in the dark looking for the door... Both of your loops require allocating memory for the queue elements or for the array you are building. If you pre-allocate and repalce the array instead of building it, then we can stop thinking about call to the OS to allocate memory being a common bottle kneck. Please see Q below my avatar. Ben

QUOTE (Gary Rubin @ May 1 2009, 09:45 AM) I have had many questions about what the profiler shows me in recent version as well. Run some benchmark tests to see if they confirm what the profile is showing. Ben

QUOTE (Gary Rubin @ May 1 2009, 08:43 AM) HI Gary, I don't know the answer to your Q but I am curious. If you changed your code such that all of the enqueues happened and then all of the dequeues, I wonder if it would change the numbers. My thoughts for this are due to the scheduling of paralllel tasks may be different so the dequeue maybe taking loanger since it is waiting for something to show up in the queue. I just wonder if there is some interaction between the two loops. So no answer here, just more Q's. Ben

QUOTE (drake27 @ Apr 29 2009, 09:28 AM) I confess, I don't know what you are trying to do. Do you have a VI and you need to know who was the orignal author? If so post and maybe one of us can recognize it. Otherwise, please clairfy your question. Ben

QUOTE (Cat @ Apr 28 2009, 08:04 AM) What was the method you used to narrow it down to the lvsound.dll? Not that I question that as the reason but I am curious what signs other than the memory jumping that got you looking at that dll? Thanks for the update! Ben

QUOTE (Darren @ Apr 24 2009, 11:45 AM) Back in the day... When I fist passed my CLA (#54) the exam read like a LV trivia test on steroids. That Q would have been appropriate. Ben

QUOTE (crossrulz @ Apr 24 2009, 09:02 AM) If you use a floating pointing data type you can use "NaN" for all points that should NOT be plotted. Ben

A point re: Queues that I don't think was previously mentioned. Queues (and other related sync functions) are special in LV because they can be used as "virtual wires" that can be used to tie together widgets dynamically at run time. Ben

QUOTE (Gary Rubin @ Apr 23 2009, 10:22 AM) Thank you Gary! Since we have wondered to the topic of performance I'll share my list of code construct choice from fastest to slowest where in/out arrays are the same size. LV Primative - Like the Multiply Array. For Loop - LV pre-allocates and replaces While Loop with Pre-allocated array - Fater because of no need to re-allocate more momory. While Loop no pre-allocate I am not usre about the For Loop with condition terminal but I'd gues it fits in after the For Loop but before the While Loop with pre-allocated buffer. Ben

As an old hardware guy I have to make a point. Interupts and traps are similar but differ in their origin and their timing. Interupts are asyncronous while traps are syncronous. Interupts can at any time regardless of what is happening in the code. An example of this is you move the mouse and an interupt is fired (a signal is asserted on a bus) reuslting in the current code being pushed on to the satack and the code located at the associated interupt vector is executed. A software trap differs in that it occurs as a result of some code event example, a mutex is released so the code servicing the release can check if other are waiting and if so fire the trap which can call the OS scheduler to change a thread from a resource wait state to runable and schedule same. So interupts are hardware, and traps are software. Since LV is platform independent, the reliance of the hardware interupts to implement all of the syncronizations functions would be very challenging. We now return you to your normally scheduled program. Ben

QUOTE (crelf @ Apr 22 2009, 06:24 PM) In modern versions* of LV that is a waste of time. The for loop does that "for" you behind the scenes. Yes I have tested it. No, I don't have the benchmarks handy to prove it. Ben * I think this came in at version 6 with all of the "optimization" that came with that release.

QUOTE (crossrulz @ Apr 22 2009, 04:28 PM) THe multiply array operator can replace the index and multiply code. Ben

QUOTE (bradjb911 @ Apr 22 2009, 03:28 PM) Use re-shape array? Multiple the dimensions of your 2d and use that value to spec the size of the 1-d array. Ben

QUOTE (Kevin Payne @ Apr 21 2009, 04:33 AM) I have my own museum of calculators that includes a slide rule (with slider and original instructions!) and what I concider the oldest "Pocket Calculator" since that is what its label says. It is a pocket book titled "Pocket Calculator" filled with tables of sums and products. Need to multiply two numbers?, look up the two numbers and adjust the decimal place. Ben

QUOTE (ShaunR @ Apr 17 2009, 04:38 PM) I swear I have you guys as a customer. I think my contact brings me in just to deal with talk IT at them. :headbang: Ben

QUOTE (Phillip Brooks @ Apr 17 2009, 01:23 PM) Some poeple look at Jesus as a philosopher. Under that definition he would be a LVOOPer. The Miracle oo the loaves and fishes is deffinatley LVOOP in action. :thumbup: Ben

You know yourself better thatn I can ever but LVOOP is the best way to do this. Otherwise.... Convert your existing stuff to use sub-panels then cone these off for the new version and make the required changes. load the correct version into the sub-panel when running. Ben

QUOTE (ShaunR @ Apr 17 2009, 08:48 AM) Pre-empting CRELF "That has a peel." Ben

QUOTE (jdunham @ Apr 16 2009, 05:53 PM) I think that was added at about LV 7. Prior to that being able to set the start and end followed by a cut was a virtual "secret". :ninja: Ben

QUOTE (crossrulz @ Apr 15 2009, 02:55 PM) According to http://books.google.com/books?id=hWSnSi7kI_kC&pg=PA179&lpg=PA179&dq=LabVIEW+with+Style%22+--+A+Guide+to+Better+LabVIEW+Applications+for+Experienced+LabVIEW+Users%22&source=bl&ots=PSHSJVEHNi&sig=XA8s40OB3lveVJIE4hZxjW9nILs&hl=en&ei=7DPmSdL7DYvsnQf-55WiCQ&sa=X&oi=book_result&ct=result&resnum=3' rel='nofollow' target="_blank">the bibliogrophy of "LabVIEW Advanced Programming Techniques" by Richard Bitter the article "LabVIEW with Style -- A Guide to Better LabVIEW Applications for Experienced LabVIEW Users" was originally published in 1997. So give that book a little time to catch on and let the LTR spread, then tens years ago we just starting to settle on what good style was. But even before reading the style guide I was already show my anal-retentive side. My first LV program was kind of pretty since I didn't know how to create clusters or arrays but did figure out how to grab a lot of code and do a create sub-VI. Since the resulting sub-VI used the worse case icon pattern to handle my 16 booleans in/out, it looked like a spider. Ben

QUOTE (twinsemi @ Apr 14 2009, 08:34 PM) The communication setup is common for all of the Modbus devices. Inside the stacked sequence there is a MB Serial Master Query.vi for each analyzer, a whole bunch of indicators (27 for each analyzer) and a few case structures. Anybody seen this before? THe only thing close to that should not hit you LV 8. In pre-LV 7 you were limited to less than 550 controls on the FP. Do you have any idea how many you have now (both hidden and shown) ? Ben

QUOTE (Mark Yedinak @ Apr 14 2009, 04:05 PM) Agreed. A custom control is probalbly what you really want. With an XControl you have to code a bunch of stuff including (if you want it) how the control reacts to is facade being re-sized. Ben

QUOTE (Darren @ Apr 14 2009, 03:16 PM) ... and the world will be better for this, that one wire-slinger scorned and covered with wires Still strove with his last ounce of copper to re-wire the spagetti VIs. Ben

QUOTE (crelf @ Apr 14 2009, 02:42 PM) Socrates came to the same conclusion in "Plato's Republic" when discusing "the form". Ben