efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults

ISCAS OpenIR

	efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults
	Zhu Yuanbo; Wu Jigang; Jiang Guiyuan; Chen Ke
	2012
Source	Journal of Computational Information Systems
ISSN	1553-9105
Volume	8 Issue:16 Pages:6663-6670
English Abstract	This paper presents an efficient heuristic algorithm to minimize the overhead on the reconfiguration for two-dimensional VLSI/WSI arrays in the presence of faulty processing elements (PEs). According to the locations of faulty PEs, the proposed technique is utilized to preprocess the host array by identifying some fault-free but unusable PEs as faults, which minimizes the size of the set of fault-free PEs that are actually useful for reconfiguration. Simulation results show that, the improvements over the two existing algorithms are up to 48% and 52% in terms of runtime, respectively. Moreover, the improvement increases with the increasing faulty density of the host arrays. © 2012 Binary Information Press.; This paper presents an efficient heuristic algorithm to minimize the overhead on the reconfiguration for two-dimensional VLSI/WSI arrays in the presence of faulty processing elements (PEs). According to the locations of faulty PEs, the proposed technique is utilized to preprocess the host array by identifying some fault-free but unusable PEs as faults, which minimizes the size of the set of fault-free PEs that are actually useful for reconfiguration. Simulation results show that, the improvements over the two existing algorithms are up to 48% and 52% in terms of runtime, respectively. Moreover, the improvement increases with the increasing faulty density of the host arrays. © 2012 Binary Information Press.
Indexed Type	EI
Keyword	Algorithms Heuristic Algorithms
Department	(1) School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China; (2) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China; (3) School of Computer Science and Technology Tianjin University Tianjin 300072 China
Language	英语
Content Type	期刊论文
URI	http://ir.iscas.ac.cn/handle/311060/15026
Collection	中国科学院软件研究所
Recommended Citation GB/T 7714	Zhu Yuanbo,Wu Jigang,Jiang Guiyuan,et al. efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults[J]. Journal of Computational Information Systems,2012,8(16):6663-6670.
APA	Zhu Yuanbo,Wu Jigang,Jiang Guiyuan,&Chen Ke.(2012).efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults.Journal of Computational Information Systems,8(16),6663-6670.
MLA	Zhu Yuanbo,et al."efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults".Journal of Computational Information Systems 8.16(2012):6663-6670.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院软件研究所机构知识库