期刊文献+

可重构阵列的同步性能优化算法 被引量:3

Improved Algorithm for Communication Synchronization on Reconfigurable Mesh with Faults
在线阅读 下载PDF
导出
摘要 可重构多处理器阵列上的容错技术可用来重构含有故障单元的处理器阵列,以便获得最大可用的目标阵列。现有的研究成果主要侧重于重构算法的构造,还没有涉及对重构后目标阵列的同步通讯性能的研究。提出了一种改善目标阵列同步通讯性能的电路优化算法,用来降低目标阵列行与行之间通讯的延时,使得相邻两行处理器的通讯尽可能达到同步。实验结果表明,提出的算法对不同大小、不同故障率的阵列都有相应的同步通讯性能的改善。 Fault-tolerant technique for reconfigurable multiprocessor array deals with the issue of reconstruction of the processor array which contains fault units to get the largest available target array. Previous research focused primarily on the reconfiguration algorithm, which does not involve in the study of the synchronous communication performance for reconstructed target array. This paper proposed an optimization algorithm which can improve the performance of the synchronous communication on target array as it reduces the communication delay between neighboring rows for the target array. Experimental results show that the proposed algorithm achieves improvement on communication synchronous performance on processor arrays with different scales and different fault densities.
出处 《计算机科学》 CSCD 北大核心 2012年第3期295-298,F0003,共5页 Computer Science
基金 国家自然科学基金项目(60970016)资助
关键词 超大规模集成电路(VLSI)处理器阵列 重构算法 容错 同步优化算法 VLSI array, Reconfiguration algorithm, Fault-tolerance, Synchronous optimization algorithm
  • 相关文献

参考文献12

  • 1Chen Y Y,Upadhyaya S J ,Cheng C H. A comprehensive reconfiguration scheme for fault-tolerant VLSI/WSI array processors [J]. IEEE Trans. Computers, 1997,46(12) :1363-1371.
  • 2Horita T, Takanami I. Fault-tolerant processor arrays based on the 1. 5-track switches with flexible spare distributions [J]. IEEE Trans on Computers, 2000,49 (6) : 542-552.
  • 3Kung S Y,Jean S N, Chang C W. Fault-Tolerant Array Processors Using Single-Track Switehes[J]. IEEE Trans. on Computers, 1989,38(4) : 501-514.
  • 4Roychowdhury V P, Bruck J B, Kailath T. Efficient Algorithms forReconfiguration in VLSI/WSI Arrays [J]. IEEE Trans. Computers, 1990,39(4) : 480-489.
  • 5Kuo S Y, Chen I Y. Efficient Reconfiguration Algorithms for Degradable VLSI/WSI Arrays [C]//Proc. Int'l Conf. Wafer Scale Integration. 1991:120-126.
  • 6Kuo S Y, Chen I Y. Efficient Reconfiguration Algorithms for Degradable VLSI/WSI Arrays[J]. IEEE Trans. Computer-Aided Design, 1992,11(10) : 289-301.
  • 7Low C P, Leong H W. On the Reconfiguration of Degradable VLSI/WSI Arrays[J]. IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, 1997,16(10) : 1213 1221.
  • 8Low C P. An Efficient Reconfiguration Algorithm for Degradable VLSI/WSI Arrays[J]. IEEE Trans. Computers, 2000,49 (6) : 553-559.
  • 9Wu Ji-gang, Srikanthan T. An Improved Reconfiguration algorithm for Degradable VLSI/WSI arrays[J]. Journal of Systems Architecture, 2003,49 : 23-31.
  • 10Wu Ji-gang, Srikanthan T. Partital Rerouting Algorithm for Reconfigurable VLSI Arrays[C]//Proc. of IEEE International Symposium on Circuits and Systems. Bangkok, Thailand, 2003: 641-644.

二级参考文献15

  • 1张会生,翁史烈,张小兵,袁亚雄.基于内弹道改进型零维模型的装药优化仿真[J].弹道学报,2000,12(3):32-36. 被引量:10
  • 2邓爱姣,李强,张嘉为.改进的Prim启发式算法在VLSI布线中的应用[J].沈阳工业大学学报,2006,28(5):557-559. 被引量:1
  • 3Hashimoto A, et al. Wire Routing by Optimizing Channal Assignment Within Large Appertures[C] //Proc. of 8th IEEE/ ACM Design Automation Workshop. 1971.
  • 4Wey Chin-Long. Efficient Rectilinear Steiner Tree Construction with Rectangular Obstacles[C]//Prcc. 5th WSEAS International Conference on Circuits System Selectronics Control & Signal Processign. Dallas, USA, 2006 : 204-208.
  • 5Rita M H, Bryant A J. A Spanning-Tree-based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles[C]//Proceedings of the 2003 ACM Symposium on Applied Computing. 2003 : 725-729.
  • 6Eberhart R C, Kennedy J. A New Optimizer Using Particles Swarm Theory[C]//Proc. 6th International Symposium on Micro Machine and Human Science. Nagoya,Japan, 1995:39-43.
  • 7Clerc M, Kennedy J. The Particle Swarm-explosion, Stability, and Convergence in a Multidimensional Complex Space[J]. IEEE Transactions on Evolutionary Computation, 2002, 6 (1) : 58-73.
  • 8Hanan M. On steiner's problem with rectilinear distance[J]. SIAM Journal of Applied Mathematics,1996,14(2) :255-265.
  • 9Kennedy J,Eberhart R C. A Discrete Binary Version of the Particle Swarm Optimization Algorithm[C]//Proc. of the IEEE International Conference on Systems Man and Cybernetics. Orlando,USA, 1997,V: 4104-4109.
  • 10Clerc M. Discrete Particle Swarm Optimzation illustrated by the Traveling Salesman Problem [EB/OL]. http://www. mauriceclerc. net, 2000-02-29.

共引文献4

同被引文献5

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部