计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (19): 23-25.

• 博士论坛 • 上一篇    下一篇

一种兼顾可测性和互连造价的资源分配算法

孙 强1,周 涛2,马光胜1,李海军1   

  1. 1.哈尔滨工程大学 计算机科学与技术学院,哈尔滨 150001
    2.陕西理工学院 数学系,陕西 汉中 723000
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-07-01 发布日期:2007-07-01
  • 通讯作者: 孙 强

Resource allocation algorithm simultaneously considering testability and interconnection cost

SUN Qiang1,ZHOU Tao2,MA Guang-sheng1,LI Hai-jun1   

  1. 1.School of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China
    2.Department of Maths,Shaanxi University of Technology,Hanzhong,Shaanxi 723000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-01 Published:2007-07-01
  • Contact: SUN Qiang

摘要: 提出了一种基于加权相容图的资源分配算法——WCGRAA,给出了一个与可测性和互连造价相关的权值公式,并运用一种改进的加权团划分算法对加权相容图进行处理,从而实现了在资源分配过程中兼顾电路可测性和互连造价的可能。实验结果表明该文所提出的资源分配算法对电路的可测性和互连造价两方面都有所改善。

Abstract: A Weighted Compatibility Graph-based Resource Allocation Algorithm(WCGRAA) is proposed in this paper and a weight formula concerning testability and interconnection cost is given.An improved weighted clique partition algorithm is used to handle weighted compatibility graph,thereby achieving the goal to give consideration both to circuit testability and interconnection cost.Experimental results show that the resource allocation algorithm proposed in this paper can improve circuit testability and interconnection cost.