节点文献

高级综合优化算法研究

The Research of Algorithm in High Level Synthesis Optimization

【作者】 马伯伟

【导师】 马光胜;

【作者基本信息】 哈尔滨工程大学 , 计算机软件与理论, 2003, 硕士

【摘要】 电子系统的设计复杂性和系统功能一直在呈几何级数增长,全球的竞争又加剧了产品开发周期的缩短。因此,对电子设计自动化工具的需求越来越迫切,要求也日益提高,这一切促进了EDA的发展,加速了设计方法和设计工具的更新换代。 本文在大量分析了以往高级综合系统所采用的技术基础上提出了我们的高级综合优化策略。本文提出了两种类型的高级综合方法,其一是提出了针对控制占主要部分的电路的高级综合方法,该方法采用了基于控制流图的中间表示结构,在调度过程中采用了针对该电路特点的推测技术。这是一种专用综合系统,适用面比较小,但在所针对具体的领域能够取得较理想的综合结果。 其二是提出了一种多目标的高级综合优化策略,该方法用在高级综合的调度之前,其核心是对系统进行划分,在将行为描述转化为内部表示模型的时,通过探索中间表示结果的关系来发现原设计描述中的控制关系和并行计算,以便在高级综合中取得理想的结果,同时将行为描述转化为图的过程中体现多种优化目的,所采用的中间表示模型为基于Petri网的内部表示模型,划分采用了模拟退火算法。该方法是可扩展的,允许设计者自己引入所要的优化目的。 本文实现了模拟退火算法,用于对系统所转化的图的划分,在本文的最后给出了具体的软件实现的详细说明,包括图的输入,解的格式,候选解的生成,解的造价等等,给出了部分的实验数据。

【Abstract】 The design complexity and system function of electronic system have been increasing largely , the competition from the global also shorten the design period , therefore ,the demand for the tools of electronic design automatic is tremendous and the requirement for efficiency of EDA tools is more and more precise . All of this promotes the updating of the electronic design methods and tools in some cases.In this paper we put forward two kinds of high level synthesis method based on researching the technology adopted in other HLS or HLS optimization. One is a specific HLS for control intensive designs, we adopt control-flow graph as the internal representation and use the speculation technology during the scheduling. It is efficient when applied in the control intensive design but the quality of synthesis" results is not well accepted when used for other type of design.The other is a multi-target HLS optimization method, used before the subtask of HLS scheduling .The essence of the method is a system partition algorithm, the multi-target optimization is reflected when convert the behavioral description into a graph. The purpose of the partition is to find the explicit control relation and parallel computation . The internal representation we adopted is a Petri net based one, the partition algorithm is a simulated-annealing algorithm. The method is extensible, that is to say the designers can produce and add their own optimization purpose to the method.We implement the simulated-annealing algorithm and use it to partition the graph gained from the user design .At last, we introduce and illustrate the software part, including the graph input style, the data structure of the result, the method to create candidate result and the cost of result, we also give some experiment data.

  • 【分类号】TN402
  • 【下载频次】178
节点文献中: 

本文链接的文献网络图示:

本文的引文网络