Revolver: a high-performance MIMD architecture for collision free computing
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
One of the main bottlenecks when using massively parallel processors, both RISC and CISC, and VLIW style processors has been the identification of potential parallelism in the tasks. Multi-threaded techniques for exploiting instruction- and data-level parallelism have gained renewed interest since high degrees of pipelining, caused by the increasing clock frequencies, introduce extra dependencies between instructions. Sophisticated methods implementing branch prediction and pipeline flushing during interrupts must be adopted which in addition puts more requirements onto the compilers. We present an interleaved processing architecture we call the Revolver Architecture together with a technique we call register file folding, which relieves the MIMD architecture of these dependencies to allow for collision free computing. We also discuss the implementation of the Revolver as a multi-threaded processor core, based on our presented techniques, together with some architectural strategies for implementing the Revolver Architecture as a DSP core.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| 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