Hi, I posted a question to the board, no answer, so I'll try it the old way: I have a little proof cluster, all running cvs root on linux, all sharing the disks for code and data via NFS. I'd like to know whether running on a single file is accelerated by a proof cluster, e.g. by each of the slaves skipping (number of slaves) events, starting with a given offset. Would this be easy to implement? If the number of active slaves is coupled to the number of files (I somewhat remember that): suppose I have a TDSet'ed chain, and I add a single friend tree (with as many entries as the whole chain) to it - is that handled somehow, or do I end up with a single slave running the whole job? I know I could just try all of that, but before trying I'd need to spend some (non negligible) time re-writing code, and I'd like to know whether that pays off before investing that time... If all that is documented then I just didn't find it. Pointing me to it would be sufficient ;-) Axel.
This archive was generated by hypermail 2b29 : Sun Jan 02 2005 - 05:50:06 MET