Jump to content

Parallel For-loop


Recommended Posts

Hi.

Since so much focus is on multicore and parallelism today, isn't it time for a true parallel For-loop structure? I know the compiler reputedly has some capability for unrolling unrelated cycles in a For-loop, but I still haven't seen any real-life cases of tangible performance gains from this. I often encounter For-loops with a dynamic number of cycles, but where each cycle is unrelated to the others (initialization of N instruments for instance, where N is only known at runtime). I'd like to see an option in the context menu of a For-loop saying something like "Run in parallel if possible". This would defeat shift register capability of course, among other things. The compiler obviously already has the ability to determine cycle-to-cycle relations.

Cheers,

Steen

Link to comment

QUOTE (Aristos Queue @ Apr 1 2009, 02:17 PM)

It would be reasonable to assume that LV R&D might be working on something like that.

Can you reply again to this message tomorrow with the same content so that we know it isn't an april fool wind-up?

This would be cool!

Shane.

Link to comment

QUOTE (Aristos Queue @ Apr 2 2009, 10:27 PM)

It would not be unreasonable to assume that we might be working on something like that.

Nice of you to tolerate my (essentially tongue-in-cheek) request. :worship:

I'll be looking forward to this....

Thanks AQ.

Shane.

Link to comment

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Unfortunately, your content contains terms that we do not allow. Please edit your content to remove the highlighted words below.
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...

Important Information

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