Systematic assessment of the overhead of tracing parallel programs
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
Instant replay is a classical technique developed to help programmers to cope with transient errors occurring in non-deterministic executions of parallel programs. Enough information is recorded during an initial recording phase to be able to force subsequent re-executions to be deterministic with respect to the initial one. If the time overhead of the initial recording is sufficiently low, recording can be used as a normal execution mode of parallel programs. This article describes the method used to assess systematically the overhead of the recording phase of an instant replay tool implemented for a remote procedure call (RPC) based programming model named ATHAPASCAN. Evaluation was done using synthetic programs generated from program models of classical parallel algorithms. The generality of the method comes from the possibility of generating multiple program instances from a single algorithm model. Experimental results confirm the efficiency of the tested execution replay tool.
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.000 |
| 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