Jump to content

VilasG

Members
  • Posts

    3
  • Joined

  • Last visited

    Never

VilasG's Achievements

Newbie

Newbie (1/14)

0

Reputation

  1. Just like a Labview8.5 VI is capable of doing multicore operation, the same VI when complied as a dll will have the same functionality ( in terms of multicore)? If this is possible then one can use that dll in a 7.1 application( if one doesnt want to entirely port his code to 8.5) Any ideas? Vilas G QUOTE(Vilu @ Oct 29 2007, 11:02 AM)
  2. Thanks LV rhino even i had figured out that i made mistake in equally splitting the array. After splitting the array equally, i found that the least time taken is the case when 6 cpus are in use. At 7 and 8 there seems to be a problem, i think the processor resource management by windows doesnt allow labview to use all the 8 cpus at full. maybe cpu 8 and 7 are required for handling other tasks. correct me if i am wrong By the way thanks for your diagnosis and all others who replied too... Cheers!
  3. Hi, For a couple of days now i have been studying the behaviour of labview 8.5 on a multicore processor machine. I recently upgraded from labview 7.1 and a single core processor to an 8 core machine with labview 8.5. My application was responsible for doing a very big math which took more time on 7.1 and single cpu. So my team decided to move to the multicore solution with 8.5. As suggested by NI white papers i split my input data depending on the number of cpu cores available(8 in my case) and have 8 parallel loops work independently on diff cpus and finally join the result. Before putting my actual code on this experiment i made a small vi just to investigate the behaviour. i am attaching the same here. I am puzzled by the fact that after 4 cpus the execution time increases and decreses again. If replace while loops with timed loops and manually assign different cpus then my computer freezes intermitently. Is this a known issue with labview8.5? This happens also if i have more than 2 timed loops in a vi. Please help. Vilas G
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.