Profiling parallel tests

[Eric Wilhelm]

# from Andy Armstrong
# on Monday 18 August 2008 07:19:

>On 17 Aug 2008, at 23:59, Eric Wilhelm wrote:
>> In general, the speed problem is most prominent when a large number
>> of subtests ("ok ...") are printed without much computation being
>> done by the test process.  There was some benchmarking and
>> discussion in the archives and commits one year ago if anyone cares
>> to pursue it.
>
>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!

--Eric
-- 
Like a lot of people, I was mathematically abused as a child.
--Paul Graham
---------------------------------------------------
    http://scratchcomputing.com
---------------------------------------------------