Thu, 21 Feb 2013 10:52:14 +0100 highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;
wenzelm [Thu, 21 Feb 2013 10:52:14 +0100] rev 51233
highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;
Thu, 21 Feb 2013 16:36:19 +0100 tuned misleading message
blanchet [Thu, 21 Feb 2013 16:36:19 +0100] rev 51232
tuned misleading message
Thu, 21 Feb 2013 15:10:04 +0100 merged
wenzelm [Thu, 21 Feb 2013 15:10:04 +0100] rev 51231
merged
Wed, 20 Feb 2013 19:57:17 +0100 option parallel_proofs_reuse_timing controls reuse of log information -- since it is not always beneficial for performance;
wenzelm [Wed, 20 Feb 2013 19:57:17 +0100] rev 51230
option parallel_proofs_reuse_timing controls reuse of log information -- since it is not always beneficial for performance;
Wed, 20 Feb 2013 18:04:44 +0100 prefer outdegree in comparison again (cf. 88c96e836ed6) -- NB: big jobs might hide behind small ones in this naive queuing scheme;
wenzelm [Wed, 20 Feb 2013 18:04:44 +0100] rev 51229
prefer outdegree in comparison again (cf. 88c96e836ed6) -- NB: big jobs might hide behind small ones in this naive queuing scheme;
Wed, 20 Feb 2013 15:22:22 +0100 more tight representation of command timing;
wenzelm [Wed, 20 Feb 2013 15:22:22 +0100] rev 51228
more tight representation of command timing; tuned signatures; tuned;
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip