24 September 2019 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
This paper presents a survey of the different modern High-Level Synthesis (HLS) Design Space Exploration (DSE) techniques that have been proposed so far to automatically generate hardware accelerators of different trade-offs. HLS has multiple advantages compared to traditional RT-level based hardware design. One key advantage is that a variety of different micro-architectures of unique trade-offs can be obtained from the same untimed behavioral description by setting different synthesis options. Out of all the possible micro-architectures, the ones that the designers are most interested in are the Pareto-optimal ones. The main problem is that the search space grows superlinearly with the number of synthesis options and hence heuristics have been proposed to search the space efficiently. This paper summarizes the main techniques proposed and addresses critical issues still not resolved as well identifies new opportunities in this field. It also serves as a guide for anyone wanting to create their own HLS DSE and introduces an open source graphical user interface (GUI) framework to facilitate this.
15 July 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Raising the level of VLSI design abstraction from the register transfer level (RTL) to the behavioral level has multiple advantages: 1) It reduces the turn-around-time; 2) allows faster verification; and 3) extends the reusability of the design as high-level synthesis (HLS) automatically reoptimizes the synthesized circuit when new process technologies are available by simply selecting a different technology library. Moreover, HLS makes extensive use of synthesis directives that control how to synthesize mainly loops (unroll or pipeline), arrays (register or RAM), and functions (inline or not). This further increases the reusability of the behavioral code as it enables the generation of micro-architectures with different area versus performance tradeoffs. These advantages open the door to third-party IP (3PIP) vendors providing behavioral IPs (BIPs). Unfortunately, the market of third-party BIPs is still very small and mostly limited to the HLS vendors themselves. Being so flexible is also their main weakness as it makes them only economically viable if the BIP provider can charge a large premium as it is highly unlikely that the BIP consumer will require their service again. Traditional IP vendors discriminate the price of the IP based on the amount of flexibility of the IP, e.g., RTL description versus providing a synthesized gate netlist. We envision a similar price discrimination strategy for BIPs by limiting the reusability of the BIP by partially encrypting the BIP source code. The main idea is to limit the search space, and hence, the reusability of the BIP such that it only allows the BIP consumer to generate micro-architectures within a predefined search space range. This is accomplished by selectively fixing some of the synthesis directives in the form of pragmas at the source code while leaving others explorable. By encrypting the portion of the BIP that contains the fix pragmas we can guarantee that no designs outside of the predefined search space are generated. We believe that this work could serve as catalyst to grow the BIP market.