ROOT I/O compression algorithms and their performance impact within Run 3

• Published in: Journal of physics. Conference series Vol. 1525; no. 1; pp. 12049 - 12056
• Main Authors: Shadura, O, Bockelman, B
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.04.2020
• Subjects: Algorithms; Data compression
• ISSN: 1742-6588; 1742-6596; 1742-6596
• DOI: 10.1088/1742-6596/1525/1/012049

The LHC's Run3 will push the envelope on data-intensive workflows and, since at the lowest level this data is managed using the ROOT software framework, preparations for managing this data are starting already. At the beginning of LHC Run 1, all ROOT data was compressed with the ZLIB algorithm; since then, ROOT has added support for additional algorithms such as LZMA and LZ4, each with unique strengths. This work must continue as industry introduces new techniques - ROOT can benefit saving disk space or reducing the I/O and bandwidth for online and offline needs of experiments by introducing better compression algorithms. In addition to alternate algorithms, we have been exploring alternate techniques to improve parallelism and apply pre-conditioners to the serialized data. We have performed a survey of the performance of the new compression techniques. Our survey includes various use cases of data compression of ROOT files provided by different LHC experiments. We also provide insight into solutions applied to resolve bottlenecks in compression algorithms, resulting in improved ROOT performance.