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: | |
|---|---|
| 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!
|
| Summary: | 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 steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. The actions and rewards for the proposed algorithm are selected carefully to guide the agent to its objective. We used a deep neural network to train the agent and in order to learn the the Q-values. The results of this work are compared to other state-of-the-art algorithms and are proven to be very effective and promising. |
|---|