scispace - formally typeset
C

Chaochao Feng

Researcher at National University of Defense Technology

Publications -  33
Citations -  554

Chaochao Feng is an academic researcher from National University of Defense Technology. The author has contributed to research in topics: Multicast & Router. The author has an hindex of 9, co-authored 33 publications receiving 513 citations.

Papers
More filters
Journal ArticleDOI

Methods for fault tolerance in networks-on-chip

TL;DR: The article at hand reviews the failure mechanisms, fault models, diagnosis techniques, and fault-tolerance methods in on-chip networks, and surveys and summarizes the research of the last ten years.
Journal ArticleDOI

Addressing Transient and Permanent Faults in NoC With Efficient Fault-Tolerant Deflection Router

TL;DR: A fault-tolerant solution for a bufferless network-on-chip is proposed, including an on-line fault-diagnosis mechanism to detect both transient and permanent faults, a hybrid automatic repeat request, and forward error correction link-level error control scheme to handle transient faults and a reinforcement-learning-based fault-Tolerant deflection routing (FTDR) algorithm to tolerate permanent faults without deadlock and livelock.
Proceedings ArticleDOI

A reconfigurable fault-tolerant deflection routing algorithm based on reinforcement learning for network-on-chip

TL;DR: Experimental results show that in the presence of faults, FTDR and FTDR-H are better than other fault-Tolerant deflection routing algorithms and a turn model based fault-tolerant routing algorithm.
Proceedings ArticleDOI

FoN: Fault-on-Neighbor aware routing algorithm for Networks-on-Chip

TL;DR: A Fault-on-Neighbor (FoN) aware deflection routing algorithm for NoC which makes routing decision based on the link status of neighbor switches within 2 hops to avoid fault links and switches is proposed.
Journal ArticleDOI

Mobile relay deployment in multihop relay networks

TL;DR: Theoretical analysis and simulation results show that, compared with traditional search algorithms, solutions based on the maximum matching and the maximum flow technologies have O ( n 2 ) complexity, and they perform better than traditional ways on the number of paths and system overhead.