Synthesizing optimal registerfile architectures for FPGA technology
Bibliographic record
Abstract
This paper presents for the first time an optimization approach to synthesis of application-specific registerfile architectures which are targeted for field programmable gate array (FPGA) technologies. A new integer programming (IP) model is presented that supports simultaneous scheduling, binding, and allocation, to minimize the number of registerfiles and the interconnect complexity (or the number of tristate drivers and multiplexor inputs). The TP model is used to map an application to a registerfile architecture suitable for prototyping or implementation in user-programmable FPGA technologies, such as Xilinx 4000. The same model supports early transferring of data on busses, and at most one registerfile is connected to each bus. Application-specific architectures with fewer busses, fewer registerfiles and up to 34% fewer bus connections than previous research have been synthesized. These IP synthesized architectures have also been successfully implemented in Xilinx 4000 FPGA technology to verify the approach. This research breaks new ground by (1) simultaneously scheduling, binding, and allocating registerfile architectures in practical cpu times, (2) synthesizing architectures which are suitable for prototyping or implementing in user-programmable FPGA technologies and (3) providing industry with a DA tool for synthesizing architectures with low interconnect complexity.>
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".