桂林电子科技大学学报2017，Vol.37Issue(6)：458-462,5.
基于整数规划的最大目标阵列重构算法
Integer programming-based reconfiguration algorithm for maximum target arrays
摘要
Abstract
In order to obtain a maximal size target processor array,an algorithm based on integer programming is proposed to reconfigure processor arrays.In this algorithm,fault-free process elements in the host array are converted into variables of the integer programming problem,and equations about these variables are defined according to the constraints of mesh structure of processor arrays.Thus,the problem of constructing maximum size target arrays can be converted into the inte-ger programming problem that maximizing the sum of these variables.The problem can be solved by using relevant integer programming solvers.Experimental results show that compared with existing algorithms,the proposed algorithm can in-crease the scale of target arrays effectively and improve the reliability of processor system.关键词
处理器阵列/重构/整数规划/算法/可靠性Key words
processor arrays/reconfiguration/integer programming/algorithm/reliability分类
信息技术与安全科学引用本文复制引用
王意萍,钱俊彦..基于整数规划的最大目标阵列重构算法[J].桂林电子科技大学学报,2017,37(6):458-462,5.基金项目
国家自然科学基金(61562015),广西自然科学基金(2015GXNSFDA139038),桂林电子科技大学研究生教育创新计划(2016YJCX12) （61562015）
