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

Yanlong He

dblp:371/4506 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 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
Reconfigurable computing and FPGAs · 62% Parallel and multicore computing · 38%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › dynamic reconfiguration
processor array reconfiguration
0.812024
Efficient 3-D Processor Array Reconfiguration Algorithms Based on Bucket Effect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Parallel and multicore computing › array processor
3d processor arrays
0.212024
Efficient 3-D Processor Array Reconfiguration Algorithms Based on Bucket Effect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Parallel and multicore computing › parallel architecture
massively parallel processing
0.212024
Efficient 3-D Processor Array Reconfiguration Algorithms Based on Bucket Effect · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024

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

heuristic optimization · 0.8compensation strategy · 0.8
YearPublicationVenuePosition
2025 Frequency bounds for edges and paths in optimal Hamiltonian cycle based on frequency Kis
Yong Wang 0027, Yanlong He
Expert Syst. Appl.3
2024 Efficient 3-D Processor Array Reconfiguration Algorithms Based on Bucket Effect
abstract
With the progressive augmentation of the density of 3-D processor arrays, some processor elements (PEs) often fail due to overload or overheating during massively parallel computing operations. Therefore, it is necessary to take effective fault-tolerant technology to ensure the reliability of the system. This article investigates an efficient reconfiguration method to construct 3-D fault-free logical subarray with more fault-free PEs and less interconnection length (interlength). First, we propose a novel method based on the barrel effect to find the bottleneck plane of 3-D processor arrays. Second, an efficient compensation strategy is proposed to replace faulty PEs on adjacent physical planes with fault-free PEs on the bottleneck planes, which leads to more fault-free PEs that can be used to construct the subarray. Then, we propose a heuristic to construct the subarray and optimize iteration redundancy to accelerate reconstruction. Finally, a heuristic optimization algorithm is proposed to reduce the interlength between PEs, which can reduce the dynamic power consumption and communication costs. In addition, we propose a more accurate method to calculate the lower bound of the interlength to better evaluate the performance of the algorithm. Simulation experiments show that, compared to the state-of-the-arts, on$128\times 128\times 128$host array, the utilization rate of fault-free PEs can be improved up to 15.6% and the interlength redundancy can be reduced by 78.2% for random faults. On$64\times 64\times 64$host array, the average improvement of the two indicators under clustered faults can reach 93.2% and 69.3%. Moreover, for all cases considered, the proposed new lower bound and reconstruction time can be reduced by an average of 18.47% and 76.13%, respectively.
Hao Ding 0007, Yanlong He, Zhongyi Zhai, Zhi Li 0017, Junyan Qian, Lingzhong Zhao
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2