A dual round-robin arbiter for split-transaction buses in system-on-chip implementations
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
This paper presents a dual round-robin arbiter for split transaction buses with separate address and data lines for use in system-on-chip implementations of shared-memory multiprocessors. The dual round-robin arbiter provides independent arbitration for requests on the address bus and responses on the data bus. For writeback requests that require simultaneous use of address and data lines, the arbiters for the separate buses interact in order to allow a writeback to proceed. The arbiters serve other requests until such time that they can match their separate states to serve a writeback request. It can be shown that this approach ensures a bounded waiting time and avoids the use of ad hoc approaches to temporarily increase request priority. A VHDL implementation of the arbiter design has been completed and tested in detailed logic simulation to confirm proper functionality in preparation for integration with other components in programmable logic.
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.000 | 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