Compiler-in-the-loop exploration during datapath synthesis for higher quality delay-area trade-offs
Compiler-in-the-loop exploration during datapath synthesis for higher quality delay-area trade-offs
复制标题
数据路径综合期间的编译器在环探索，以实现更高质量的延迟区域权衡
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
G. Economakos
中科院分区：
文献类型：
--
作者：
S. Xydis;K. Pekmestzi;D. Soudris;G. Economakos
高级综合过程中的设计空间探索的目标是计算形成最佳折衷点的设计解。这种对最佳权衡的追求一直专注于研究高级综合算法中各种架构级参数的影响，而默默地忽略了行为级参数和架构级参数的组合影响所产生的权衡。我们提出了一种新的设计空间探索方法，该方法研究了结合编译器级和架构级转换的解决方案空间的扩展实例。结果表明，在全球范围内探索设计空间会揭示新的折衷点，从而转向更高质量的设计解决方案。我们使用上界条件和基于梯度的启发式剪枝的组合来有效地遍历扩展的搜索空间。我们的探索框架在不影响已发现解决方案的最佳性(帕累托精确度)的情况下提供了显著的质量改进，并且与在每个分配场景中穷尽地探索解决方案空间相比，显著减少了运行时间。
Design space exploration during high-level synthesis targets the computation of those design solutions which form optimal trade-off points. This quest for optimal trade-offs has been focused on studying the impact of various architectural-level parameters during high-level synthesis algorithms, silently neglecting the trade-offs produced from the combined impact of behavioral-level together with architectural-level parameters. We propose a novel design space, exploration methodology that studies an extended instance of the solution space considering the effects of combining compiler- and architectural-level transformations. It is shown that exploring the design space in a global manner reveals new trade-off points, thus shifting towards higher quality design solutions. We use a combination of upper-bounding conditions together with gradient-based heuristic pruning to efficiently traverse the extended search space. Our exploration framework delivers significant quality improvements without compromising the optimality (Pareto accuracy) of the discovered solutions, together with significant runtime reductions compared to exploring exhaustively the solution space at every allocation scenario.
影响因子：
2
作者：
Murray A
通讯作者：
Murray A