Welcome, guest | Sign In | My Account | Store | Cart

Collects statistics on different algorithms for grouping thousands of tests for execution on a compute farm where you are limited to much less job slots, (tens).

Python, 179 lines
 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179``` ```import random # Version 1.1 - Extended reporting. Donald 'Paddy' McCarthy 2004-04-25 def rand_jobs(jobs = 10001, # number of jobs in a regression jobtime_spread = [90, 1,9], # 90% take 1..4 mins, 1% take 4..20 mins jobtime_split = [5,21,41]): # and 9% take 20..40 mins to complete 'randomly generate jobs to a profile' assert sum(jobtime_spread)==100 shortjobs = [ random.randrange(1,jobtime_split) for x in xrange(jobs*jobtime_spread/100)] mediumjobs = [ random.randrange(jobtime_split,jobtime_split) for x in xrange(jobs*jobtime_spread/100)] longjobs = [ random.randrange(jobtime_split,jobtime_split) for x in xrange(jobs*jobtime_spread/100)] return shortjobs + mediumjobs + longjobs def sort_and_sow(job, bins): ''' sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins..0..bins..]''' job.sort() bin = list() for i in range(bins): bin.append(job[i::2*bins] + job[2*bins-1-i::2*bins]) bin[-1].sort() # Sort makes more tests finish early return bin def rev_sort_and_sow(job, bins): ''' reverse sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins..0..bins..]''' job.sort() job.reverse() bin = list() for i in range(bins): bin.append(job[i::2*bins] + job[2*bins-1-i::2*bins]) bin[-1].sort(); bin[-1].reverse() return bin def sort_and_place(job, bins): ''' sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins,0..bins,...]''' job.sort() bin = list() for i in range(bins): bin.append(job[i::bins]) return bin def rev_sort_and_place(job, bins): ''' reverse sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins,0..bins,...]''' job.sort() job.reverse() bin = list() for i in range(bins): bin.append(job[i::bins]) return bin def rand_binning_avg_count(job, bins): 'fill bins randomly, but with averaged items in a bin' random.shuffle(job) return [job[i::bins] for i in range(bins)] def pure_rand(job, bins): 'fill bins randomly' bin = [list() for i in range(bins)] random.shuffle(job) for j in job: bin[random.randrange(bins)] += [j] return bin def binning_stats(binning, filler='', pr=False): 'Prints stats on the how the bins are filled' bin_times = [sum(bin) for bin in binning] target_time = sum(bin_times)/1.0/len(bin_times) regression_time = max(bin_times) closeness = test_completion_stats(binning, target_time) if pr: print "%-25s [50, 75, 87.5, 100]%% of tests finish after %s%% of Target time: %7.3f" % (filler, ["%5.1f" % c for c in closeness], target_time ) return closeness def time_accumulator(t): ' Do "time_accumulator.t = 0" before use' time_accumulator.t += t return time_accumulator.t def test_completion_stats(binning, target_time): 'How long for 50,75,87.5, and 100% of tests to complete (as a percentage of target_time' # change run times to times of completion for each bin completion_bins = list() for bin in binning: time_accumulator.t = 0.0 completion_bins.append( [time_accumulator(duration) for duration in bin] ) #merge completion times for each bin completion_times = sum(completion_bins,[]) completion_times.sort() #find the times for tests to complete end_time = completion_times[-1] # last element num_tests = len(completion_times) num50 = num_tests*50/100-1 num75 = num_tests*75/100-1 num87 = num_tests*875/1000-1 # 87.5% time_to_50 = time_to_75 = time_to_87 = time_to_100 = 0 for n,ct in enumerate(completion_times): if n==num50: #found when 50% tests finished time_to_50 = ct if n==num75: #found when 75% tests finished time_to_75 = ct if n==num87: #found when 87.5% tests finished time_to_87 = ct break time_to_100 = end_time return [time_to_50*1.0/target_time*100, time_to_75*1.0/target_time*100, time_to_87*1.0/target_time*100, time_to_100*1.0/target_time*100] def hm(mins): ' convert minutes to hours+minutes as string' return '%02i:%5.2f' % (int(mins / 60), mins-60*int(mins / 60)) if __name__ == "__main__": repititions = 100 # Number of regressions to run job_slots = 99 # number of LSF jobs I can run tests = 10001 # Number of tests in a regression jobtime_spread = [90, 9,1] # y% in first range below, ...y% in third jobtime_split = [4,16,61] # 1 to x-1, x to x-1, x to x-1 pr = False # Print as we go? ''' repititions = 1 # Number of regressions to run job_slots = 2 # number of LSF jobs I can run tests = 20 # Number of tests in a regression jobtime_spread = [90, 9,1] # y% in first range below, ...y% in third jobtime_split = [4,16,61] # 1 to x-1, x to x-1, x to x-1 pr = True # Print as we go? ''' algorithms = [(sort_and_sow,"sort_and_sow"), (rev_sort_and_sow,"rev_sort_and_sow"), (sort_and_place,"sort_and_place"), (rev_sort_and_place,"rev_sort_and_place"), (rand_binning_avg_count,'rand_binning_avg_count'), (pure_rand,'pure_rand'), ] closeness = dict() # for cumulative stats last_bin = dict() # debug copy of last bins mean_target_time = 0.0 # Calculates theoretical minimum time for avg Regression # for x in xrange(repititions): jobs = rand_jobs(jobtime_spread=jobtime_spread, jobtime_split = jobtime_split, jobs=tests) mean_target_time += sum(jobs)*1.0/job_slots for algo, algo_name in algorithms: binning = algo(jobs[:],job_slots) last_bin[algo_name] = binning tmp = binning_stats(binning, algo_name, pr=pr) closeness[algo_name] = [ sum(percent) for percent in zip(closeness.get(algo_name,[0,0,0,0]), tmp) ] if pr: print '' mean_target_time /= repititions print '' print 'Results from %i regressions each of %i tests using %i job_slots' % (repititions, tests, job_slots) print ' Random test times profile is:' print ' %-3s from %2i to %2i minutes' % (`jobtime_spread`+'%', 1, jobtime_split-1) print ' %-3s from %2i to %2i minutes' % (`jobtime_spread`+'%', jobtime_split, jobtime_split-1) print ' %-3s from %2i to %2i minutes' % (`jobtime_spread`+'%', jobtime_split, jobtime_split-1) print ' Target time for a Regression run is %.1f minutes (%s)\n' % (mean_target_time, hm(mean_target_time)) for algo, algo_name in algorithms: print " %-23s [50, 75, 87.5, 100]%% tests finish in %s%% of Target time - %s" % (algo_name+':', ["%5.1f" % (c*1.0/repititions) for c in closeness[algo_name]], hm(mean_target_time*closeness[algo_name][-1]/100.0/repititions) ) ```

Our microprocessor regression test suite contains around 10000 tests which individualy take between one and fourty minutes to run on our compute farm. Most of the tests are short, less than 4 minutes, but their are some long ones of up to 40 minutes. We have a fixed number of job slots on the compute cluster and so tests are grouped for execution. This program explores several ways of grouping tests and its effect on overal runtime of the regression suite. Results show that the fastest algorithm for grouping tests would complete in two-thirds of the time of the slowest and is very close to the optimum:

Results from 100 regressions each of 10001 tests using 99 job_slots Random test times profile is: 90% from 1 to 3 minutes 9% from 4 to 15 minutes 1% from 16 to 60 minutes Target time for a Regression run is 306.4 minutes (05: 6.37)

sort_and_sow: [50, 75, 87.5, 100]% tests finish in [' 23.4', ' 44.8', ' 57.4', '126.7']% of Target time - 06:28.21 rev_sort_and_sow: [50, 75, 87.5, 100]% tests finish in [' 77.3', ' 91.2', ' 96.4', '107.3']% of Target time - 05:28.74 sort_and_place: [50, 75, 87.5, 100]% tests finish in [' 23.4', ' 44.9', ' 57.4', '110.1']% of Target time - 05:37.40 rev_sort_and_place: [50, 75, 87.5, 100]% tests finish in [' 77.2', ' 90.9', ' 97.0', '110.1']% of Target time - 05:37.40 rand_binning_avg_count: [50, 75, 87.5, 100]% tests finish in [' 49.3', ' 74.3', ' 88.3', '145.1']% of Target time - 07:24.63 pure_rand: [50, 75, 87.5, 100]% tests finish in [' 49.5', ' 74.8', ' 89.9', '152.3']% of Target time - 07:46.47 Created by Paddy McCarthy on Sat, 24 Apr 2004 (PSF)