ROOT Parallelisation, Performance and Programming Model Meeting
Present: Enrico, Enric, Guilherme, Xavi, Gerri, Philippe, Danilo
Parallel hadd:
- We need to understand the penalty when merging with one worker
- For merging trees we can only check if changing compression algorithm/parameters
- Parallel merging of files containing trees is hardly beneficial due to the large amount of write/read operations wrt the sequential case.
TDF Sprint:
- The plan for the sprint is agreed
- Vassil will be put in the loop as there is a lot of interplay with his program of work
- Examples of different formats in input can be already constructed building trees starting from csv files or, potentially, sql files via TTreeSQL.
The items we discussed for release 6.10 have been added to JIRA: https://sft.its.cern.ch/jira/browse/ROOT-8754