By breaking each DB handle out to a different core, you could still have idle time (one DB handle consistently takes longer to complete the query, for example).
Can your problem be broken down more at the higher level? In other words, instead of breaking each handle out to a different thread, break the top level data set into N smaller sets and distribute those smaller jobs out to the individual cores. Each core would still have M (4 in this case?) DB handles, but each core could stay busy (less the slight overhead for managing the data sets).
Now, if all of the top-level data is interdependent, then never mind :-)
--MidLifeXis
In reply to Re^3: querying multiple databases in parallel -- attach problem #2
by MidLifeXis
in thread querying multiple databases in parallel -- attach problem #2
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |