MétaCan
Menu
Back to cohort
Record W7132988041

Increasing FPGA CAD Adaptability using Reinforcement Learning and Smart Perturbations

2024· dissertation· W7132988041 on OpenAlexfundno aff
Mohamed Adel Attia Elhady Elgammal

Bibliographic record

VenueTSpace · 2024
Typedissertation
Language
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsnot available
FundersUniversity of TorontoVMware
KeywordsAdaptabilityField-programmable gate arrayExploitCADCritical path methodBlock (permutation group theory)Reinforcement learningPath (computing)
DOInot available

Abstract

fetched live from OpenAlex

Field-programmable gate arrays (FPGAs) continue to evolve to best exploit the capabilities of new manufacturing technologies and to meet new applications’ needs. Hence, there is a need for an adaptable, high-quality FPGA computer-aided design (CAD) flow that can evaluate new architectural ideas. FPGA CAD tools should also efficiently map complex designs from various applications to completely defined devices in a short runtime to speed up design cycles and increase productivity. This thesis focuses on enhancing the adaptability and efficiency of the open-source VTR CAD flow,with a specific emphasis on the packing and placement stages. As placement is the most time-consuming stage in the FPGA CAD flow, we investigate various techniques to optimize it. First, we propose multiple smart perturbations that relocate blocks during simulated annealing placement to optimize both the wirelength and the critical path delay of the design. Second, we formulate the problem of selecting the move type to use at each point in the anneal as a reinforcement learning problem (introducing RLPlace). Subsequently, RLPlace 2.0 advances this concept by empowering the agent not only to determine the move type but also the specific block type to be moved. This innovation significantly enhances adaptability, allowing the tool to cater to a broader spectrum of FPGA architectures and application domains, while simultaneously improving the quality and the runtime of the flow. Additionally, to allow a more flexible CAD flow, we introduce the re-clustering API that can efficiently modify the packing decisions in various stages throughout the flow. This API opens the door for exploring many ideas like breaking the barrier between packing and placement by enabling more fine-grained moves during placement or building a generic legalizer for semi-legal flat placers. We verify the efficacy of the re-clustering API by implementing a multi-threaded iterative improvement packing algorithm. We also enhance the software engineering of VTR by doing code refactoring, implementing new graphical interfaces and much more. By combining adaptive RL algorithms, APIs to facilitate additional optimization, and a better engineered and flexible software tool, this thesis represents a significant stride towards a more adaptable and efficient FPGA CAD flow.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.024
GPT teacher head0.312
Teacher spread0.288 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicVLSI and FPGA Design TechniquesFrench-language works237,207