Hi Marian,
Marian Ivanov wrote on 07/19/2010 09:54 AM:
> CPU time for merging is smaller (in comparison with 5.26.xxx) but still
> I observe non linear time dependence of merging.
> See attached picture - time to merge versus merge number.
thanks for the timing info, I will investigate. Do the different merge steps have approximately the same number of filled bins? The step from 4 to 5 is a bit scary...
> but I think that
> you can try to implement THnSparse in non sparse mode in case of
> occupancy > something.
> I expect it will save time, and also disk space. As we discussed before.
Yes, agreed :-) Do you know someone who could implement this? Otherwise I will do it, but I cannot guarantee a date for that...
Cheers, Axel. Received on Mon Jul 19 2010 - 10:03:09 CEST
This archive was generated by hypermail 2.2.0 : Wed Jul 28 2010 - 17:50:01 CEST