Am Sun, 24 Feb 2008 15:17:55 +0100 schrieb Thorsten Froehlich:

> 
> You cannot predict the depth of any subtree, which makes it rather
> expensive.
> 
> 	Thorsten

This is true. However, if one thread is finished with its subtree before 
another it will get a new task as soon as the other one tries to recurse. 
But even if we do not reassign tasks to threads like this building in 
parallel would be faster. I would try to implement this if the unix 
source was also released. Unfortunately I do not own a copy of Visual 
Studio.

Post a reply to this message