Using estimates from behavioral synthesis tools in compiler-directed design space exploration

Citations Over TimeTop 10% of 2003 papers

Abstract

This paper considers the role of performance and area estimates from behavioral synthesis in design space exploration. We have developed a compilation system that automatically maps high-level algorithms written in C to application-specific designs for Field Programmable Gate Arrays (FPGAs), through a collaboration between parallelizing compiler technology and high-level synthesis tools. Using several code transformations, the compiler optimizes a design to increase parallelism and utilization of external memory bandwidth, and selects the best design among a set of candidates. Performance and area estimates from behavioral synthesis provide feedback to the compiler to guide this selection. Estimates can be derived far more quickly (up to several orders of magnitude faster) than full synthesis and place-and-route, thus allowing the compiler to consider many more designs than would otherwise be practical. In this paper, we examine the accuracy of the estimates from behavioral synthesis as compared to the fully synthesized designs for a collection of 209 designs for five multimedia kernels. Though the estimates are not completely accurate, our results show that the same design would be selected by the design space exploration algorithm, whether we use estimates or actual results from place-and-route, because it favors smaller designs and only increases complexity when the benefit is significant.

Related Papers

• → Advanced loop optimizations for parallel computers(1988)24 cited
• → An evaluation of an automatically generated compiler(1995)12 cited
• → An automatically generated, realistic compiler for imperative programming language(1988)12 cited
• → An applicative compiler for a parallel machine(1982)1 cited
• Comparative Cross-Platform Performance Results from a Parallelizing SML Compiler(2001)