That would work in a multi-processor environment, where each chip can be
assigned to one task, thus bringing a real benefit in terms of
processing speed. Currently though, and I would love to be corrected if
wrong, RB does not take any advantage of multiple processors.
In my experience, threads do not add any significant performance gain in
raw processing speed. On the contrary, using a loop with BackgroundTasks
to False always produced far better results.
Where threads are very useful, in my opinion, is in the _perceived_
speed and responsiveness of the application, which is very important to
the end user. Giving the user the ability to stop a task or completing a
calculation during idle cycles creates the positive impression of a much
higher speed overall, even though the raw numbers show that the tasks
take actually longer to complete.
--
Andrea Suraci
www.ilexsoft.com
Jay Rimalrick wrote:
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?
_______________________________________________
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>
