Is it possible to break a problem into X chunks, declare X threads, and have a time reduction of 1/X assuming the chunks can be processed in parallel? Or is it the case that the X threads will just share the available processing power in a round robin fashion and there will not be any time reduction? I think the latter is true, but I would appreciate other comments.
Yes if you can spawn the threads across multiple processors or cores. Currently RB native threads are cooperative and do not run on multiple processors. I have published a tool kit, PreemptiveThreadTD, that allows you to execute RB code in a preemptive thread and take advantage of multiple processors. However, users are reporting crashing on Mac OS X. I've nailed a couple bugs but I still have one left to squash. Unfortunately I'm trying to finish another project with a deadline so I've been prevented from getting PreemptiveThreadTD 1.1 out. As soon as that's done I will try and squash the final bug and release 1.1. Daniel L. Taylor Taylor Design Computer Consulting & Software Development [EMAIL PROTECTED] www.taylor-design.com _______________________________________________ Unsubscribe or switch delivery mode: <http://www.realsoftware.com/support/listmanager/> Search the archives of this list here: <http://support.realsoftware.com/listarchives/lists.html>
