中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
efficient heuristics for minimizing reconfiguration overhead on vlsi arrays with faults
Author: Zhu Yuanbo ; Wu Jigang ; Jiang Guiyuan ; Chen Ke
Keyword: Algorithms ; Heuristic algorithms
Source: Journal of Computational Information Systems
Issued Date: 2012
Volume: 8, Issue:16, Pages:6663-6670
Indexed Type: EI
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
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.
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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15026
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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-01-01,8(16):6663-6670.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhu Yuanbo]'s Articles
[Wu Jigang]'s Articles
[Jiang Guiyuan]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhu Yuanbo]‘s Articles
[Wu Jigang]‘s Articles
[Jiang Guiyuan]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace