Optimizing ATLAS code with different profilers
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
After the current maintenance period, the LHC will provide higher\\nenergy collisions with increased luminosity. In order to keep up with\\nthese higher rates, ATLAS software needs to speed up\\nsubstantially. However, ATLAS code is composed of approximately 6M\\nlines, written by many different programmers with different\\nbackgrounds, which makes code optimisation a challenge. To help with\\nthis effort different profiling tools and techniques are being\\nused. These include well known tools, such as the Valgrind suite and\\nIntel Amplifier; less common tools like Pin, PAPI, and GOoDA; as well\\nas techniques such as library interposing. In this paper we will\\nmainly focus on Pin tools and GOoDA. Pin is a dynamic binary\\ninstrumentation tool which can obtain statistics such as call counts,\\ninstruction counts and interrogate functions' arguments. It has been\\nused to obtain CLHEP Matrix profiles, operations and vector sizes for\\nlinear algebra calculations which has provided the insight necessary\\nto achieve significant performance improvements. Complimenting this,\\nGOoDA, an in-house performance tool built in collaboration with\\nGoogle, which is based on hardware performance monitoring unit events,\\nis used to identify hot-spots in the code for different types of\\nhardware limitations, such as CPU resources, caches, or memory\\nbandwidth. GOoDA has been used in improvement of the performance of\\nnew magnetic field code and identification of potential vectorization\\ntargets in several places, such as Runge-Kutta propagation code.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it