A Case Study for a New Invasive Extension of Intel’s Threading Building Blocks
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
We study codes deploying multiple MPI ranks to one node where \neach rank is parallelised with TBB. A static assignment of cores to \nranks here is disadvantageous if the load is not perfectly balanced, \nthe runtime is subject to fluctuations or one MPI rank runs through \nphases with low concurrency. We propose an extension to TBB \nwhere developers manually annotate which code parts could exploit \nfurther cores. The cores are then dynamically associated with \nranks. Our approach is decentralised, lightweight and minimally \ninvasive w.r.t. code modifications. Some brief performance studies \nsuggest that a flexible, permanently changing assignment of cores \nto compute ranks can outperform a static distribution, while greedily \nhaggling over cores throughout a simulation might perform \neven better.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.003 |
| 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