Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yupeng Chi

dblp:436/2014 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0009-8254-7117ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 87% Parallel and multicore computing · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › reconfiguration
fault-tolerant reconfiguration
1.012026
Efficient Shortest Path-Driven Tabu Search Reconfiguration Algorithm for Multiprocessor Array · IEEE Trans. Dependable Secur. Comput. 2026
Hardware reliability and fault tolerance › reconfiguration
topology reconfiguration
1.012026
Efficient Shortest Path-Driven Tabu Search Reconfiguration Algorithm for Multiprocessor Array · IEEE Trans. Dependable Secur. Comput. 2026
Parallel and multicore computing
multiprocessor system
0.312026
Efficient Shortest Path-Driven Tabu Search Reconfiguration Algorithm for Multiprocessor Array · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

tabu search · 1.0shortest path algorithm · 1.0
YearPublicationVenuePosition
2026 Efficient Shortest Path-Driven Tabu Search Reconfiguration Algorithm for Multiprocessor Array
abstract
Fault-tolerant reconfiguration is essential for improving the reliability and efficiency of multiprocessor arrays. However, existing reconfiguration approaches primarily focus on algorithmic optimization, often neglecting architectural imbalance and communication bottlenecks arising from asymmetric redundancy placement. To overcome these limitations, this paper proposes an efficient framework that combines a novel double-sided redundant architecture with two-stage optimization algorithms to enhance interconnect efficiency under permanent processing element (PE) faults. The proposed$R_{l}+M+R_{r}$architecture symmetrically distributes redundant columns on both sides of the array while maintaining the same total number of spare PEs as single-sided redundancy, thereby mitigating unbalanced compensation paths and long communication distances without increasing hardware cost. Based on this structure, a shortest-path fault compensation algorithm is developed to minimize inter-PE communication distances, and a wide Tabu-based optimization algorithm is introduced as a second-stage refinement for global exploration and multi-directional reconfiguration. Experimental evaluations demonstrate that the proposed framework achieves superior communication performance and scalability compared with state-of-the-art methods under both single-sided and double-sided redundant architectures. It achieves lower latency, higher throughput, and reduced energy consumption while maintaining identical redundant resources and a smaller interconnect area footprint, confirming the efficiency and practicality of the proposed fault-tolerant topology reconfiguration strategy.
Hao Ding 0007, Yupeng Chi, Junyan Qian, Shuxiang Song 0001
IEEE Trans. Dependable Secur. Comput.2