Issue |
EPJ Web Conf.
Volume 214, 2019
23rd International Conference on Computing in High Energy and Nuclear Physics (CHEP 2018)
|
|
---|---|---|
Article Number | 05003 | |
Number of page(s) | 8 | |
Section | T5 - Software development | |
DOI | https://doi.org/10.1051/epjconf/201921405003 | |
Published online | 17 September 2019 |
https://doi.org/10.1051/epjconf/201921405003
Continuous Performance Benchmarking Framework for ROOT
1
University of Nebraska Lincoln,
1400 R St,
Lincoln, NE 68588,
United States
2
Princeton University,
Princeton,
New Jersey 08544,
United States
* e-mail: oksana.shadura@cern.ch
** e-mail: vvasilev@cern.ch
*** e-mail: brian.bockelman@cern.ch
Published online: 17 September 2019
Foundational software libraries such as ROOT are under intense pressure to avoid software regression, including performance regressions. Continuous performance benchmarking, as a part of continuous integration and other code quality testing, is an industry best-practice to understand how the performance of a software product evolves. We present a framework, built from industry best practices and tools, to help to understand ROOT code performance and monitor the efficiency of the code for several processor architectures. It additionally allows historical performance measurements for ROOT I/O, vectorization and parallelization sub-systems.
© The Authors, published by EDP Sciences, 2019
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.