Profiling parallel tests

[Andy Armstrong]

On 18 Aug 2008, at 18:18, Eric Wilhelm wrote:
>> I think that in this case we're probably seeing something like the
>> scheduler being O(N^2) and there being a large number of tests.
>
> Oh right.  I should have looked at Nick's profiler output more
> carefully.
>
> So, why is scheduling so complicated?  O(N^2) implies that scheduling
> the next test requires us to run through the list of already completed
> tests!


It's probably not quite N^2 but I bet it doesn't scale particularly  
well. It's like that for no better reason than that I figured I'd get  
it working and then discover whether it was fast enough. Evidently it  
isn't :)

I'll take a look at it this week. Thanks for the investigation by the  
way Nicholas.

-- 
Andy Armstrong, Hexten