Deep Reinforcement Learning for Resource Constrained HLS Scheduling
High-level synthesis (HLS) scheduling, an NP-hard problem, is a process that auto-mates VLSI design and is a very important step in silicon compilation. HLS takes as input a behavioral description of a system with a set of constraints and outputs an RTL description of a digital system. The two main...
Saved in:
| Main Author: | Makhoul, Rim (author) |
|---|---|
| Format: | masterThesis |
| Published: |
2022
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/13937 https://doi.org/10.26756/th.2022.419 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Layout Driven Binding In High Level Synthesis Using Reinforcement Learning
by: Melhem, Marie-Claire
Published: (2021) -
Parallel multi-voltage power minimization in VLSI circuits. (c2013)
by: Younes, Rabih Halim
Published: (2013) -
A Graph Heuristic Approach for the Data Path Allocation Problem
by: Makhoul, Racha
Published: (2022) -
An incremental approach for test synthesis and scheduling using genetic algorithms. (c2002)
by: Hajar, Aouni
Published: (2002) -
KT2C. (c2014)
by: Al Kawam, Ahmad
Published: (2016)