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.
Thanks. Jay __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.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>
