一种基于多阶段模拟退火的异构可重构阵列布局算法
A placement algorithm for HGRA based on multi-stage simulated anneal
-
摘要: 异构可重构阵列是传统粗粒度可重构阵列的扩展，通过多样的异构单元可以实现更加丰富的应用类型.但是由于阵列异构单元在阵列中的位置、资源多种多样，使得传统的模拟退火布局方法在异构结构下会出现布通率下降甚至难以布通的问题.本文通过构建基于图距离的新型代价函数，来解决传统代价函数对异构阵列建模不精确的问题；进而根据不同异构单元的特性，提出分阶段模拟退火的布局方案.与传统方案应用在异构阵列上的结果相比，应用新型代价函数的多阶段模拟退火算法在同等互连资源的条件下可以平均提高29.6%的布通率.Abstract: The heterogeneous reconfigurable array(HGRA) is a kind of expansion of traditional architecture. Traditional mapping algorithms such as simulated anneal are not suitable for new structure.This paper proposes a new multi-stage simulated anneal placement algorithm, who has a new type of cost function based on graph distance. By using new algorithm, the success rate on HGRA increases by 29.6% on average.
下载:
