Skip to content

[PWGDQ] optimized the computation of match attempts in QA task#16770

Draft
aferrero2707 wants to merge 1 commit into
AliceO2Group:masterfrom
aferrero2707:PWGDQ-matching-qa-optimize-match-attempts-calculation
Draft

[PWGDQ] optimized the computation of match attempts in QA task#16770
aferrero2707 wants to merge 1 commit into
AliceO2Group:masterfrom
aferrero2707:PWGDQ-matching-qa-optimize-match-attempts-calculation

Conversation

@aferrero2707

Copy link
Copy Markdown
Contributor

The computation of the number of match attempts for each MCH track is rather heavy and the code was calling the corresponding function multiple times.
The number of attempts is now computed only once and stored internally.

This gives a nice 3x speedup in the processing time for a typical 2024 Pb-Pb AO2D.

The computation of the number of match attempts for each MCH track is
rather heavy and the code was calling the corresponding function multiple
times.
The number of attempts is now computed only once and stored internally.
@github-actions

Copy link
Copy Markdown

O2 linter results: ❌ 0 errors, ⚠️ 0 warnings, 🔕 7 disabled

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

Development

Successfully merging this pull request may close these issues.

1 participant