• 中国期刊全文数据库
  • 中国学术期刊综合评价数据库
  • 中国科技论文与引文数据库
  • 中国核心期刊(遴选)数据库
黄弼胜, 钱俊彦. 基于网络流的高效VLSI子阵列重构[J]. 桂林电子科技大学学报, 2019, 39(6): 466-470.
引用本文: 黄弼胜, 钱俊彦. 基于网络流的高效VLSI子阵列重构[J]. 桂林电子科技大学学报, 2019, 39(6): 466-470.
HUANG Bisheng, QIAN Junyan. An efficient reconfiguration algorithm for high-performance VLSI subarray with network flow[J]. Journal of Guilin University of Electronic Technology, 2019, 39(6): 466-470.
Citation: HUANG Bisheng, QIAN Junyan. An efficient reconfiguration algorithm for high-performance VLSI subarray with network flow[J]. Journal of Guilin University of Electronic Technology, 2019, 39(6): 466-470.

基于网络流的高效VLSI子阵列重构

An efficient reconfiguration algorithm for high-performance VLSI subarray with network flow

  • 摘要: 为了提高构造高性能目标阵列的求解速度, 提出一种基于网络流思想的改进型高效算法。该算法采用一种带有数据结构的高效网络模型来减少模型的结点规模。在新的模型基础上, 该算法可以在一次迭代中同时找出多条最短路径, 减少运行时间, 从而提高高性能目标阵列重构速度。实验结果表明, 在保证得到高性能目标阵列的前提下, 该算法比其他现有算法更高效。

     

    Abstract: In order to accelerate the reconfiguration of high performance target array, an improved and efficient algorithm based on network flow is proposed. A new network model with efficient data structure is employed to reduce the size of the model. Many shortest paths can be augmented in one time based on the new data structure, thus significantly reducing the running time. The experimental results show that the proposed algorithm is more efficient than other existing algorithms on the premise of obtaining high performance target array.

     

/

返回文章
返回