MétaCan
Menu
Back to cohort

RAAP-CGRA: Placement for CGRAs with Restricted Routing Architectures

2025· article· en· W4413145102 on OpenAlex
Sebastian Czyrny, Takahide Yoshikawa, Jason Anderson

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceParallel computingRouting (electronic design automation)Computer architectureEmbedded system

Abstract

fetched live from OpenAlex

Coarse-grained reconfigurable arrays (CGRAs) are programmable hardware devices that are word-level configurable, and can be used to implement application-specific accelerators, particularly for applications that can benefit from spatial and pipeline parallelism. A considerable portion of a CGRA’s silicon area is dedicated to realizing programmability, and it is desirable to reduce this overhead, while retaining flexibility and application mappability. This work considers CAD techniques for CGRAs with reduced interconnect flexibility. Specifically, we introduce Routing-Architecture-Aware Placement for CGRAs, RAAP-CGRA, comprising CGRA placement schemes suitable for CGRAs with restricted routing architectures. At a high level, the proposed schemes penalize placements likely to be unroutable due to architectural routing constraints. Experiments on three constrained CGRA architectures show our approaches significantly improve the success rate of mapping compared to a simulated-annealing-based baseline. For one CGRA architecture with restricted routing, a baseline mapper had an 11% average success rate, while one of the proposed mappers achieved a 61% success rate.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.142
Threshold uncertainty score0.280

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.009
GPT teacher head0.258
Teacher spread0.249 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicDNA and Biological ComputingFrench-language works237,207