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.

Yuchang Zhang

dblp:171/0927 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 since 2021Artificial intelligence and machine learning · 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
Parallel and multicore computing · 44% High-performance computing · 44% GPUs and heterogeneous computing · 13%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
High-performance computing
barrier elimination
1.012026
Odin: Harnessing Rendering Visibility to Break Global Barriers in Distributed Point-Based Neural Rendering · HPDC 2026
Parallel and multicore computing › synchronization
synchronization optimization
1.012026
Odin: Harnessing Rendering Visibility to Break Global Barriers in Distributed Point-Based Neural Rendering · HPDC 2026
GPUs and heterogeneous computing › multi-GPU computing
multi-GPU training
0.312026
Odin: Harnessing Rendering Visibility to Break Global Barriers in Distributed Point-Based Neural Rendering · HPDC 2026

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

visibility metadata · 2.0ahead-of-time scheduling · 2.0
YearPublicationVenuePosition
2026 Odin: Harnessing Rendering Visibility to Break Global Barriers in Distributed Point-Based Neural Rendering
abstract
We present Odin, a training system for distributed point-based neural rendering (PBNR) that accelerates training by removing unnecessary global barriers. Odin observes that two training steps need synchronization only when they update overlapping visible parameters. It uses lightweight visibility metadata and a two-phase design with ahead-of-time scheduling plus runtime refinement to handle irregular and dynamic behavior. Odin hides 82% of exposed communication and achieves up to 1.89 × throughput speedup on 64 GPUs while preserving baseline accuracy.
Zhenxiang Ma, Yuanzhen Zhou, Yuchang Zhang, Miao Tao, Jidong Zhai, Hengjie Li
HPDC5
2023 A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems
abstract
In recent years, deep reinforcement learning has shown great potential in solving computer games with sequential decision-making scenarios. Hyper-heuristic is a generic search framework, capable of intelligently selecting or generating algorithms to solve a class of optimisation problems with stochastic or dynamic settings. This paper proposes a new general framework for solving online packing problems using deep reinforcement learning hyper-heuristics. Although analytical approaches can address most offline packing problems successfully, their online versions have proved much more challenging and the performance of the existing methods is often not satisfactory. In this paper, we extend a recent deep reinforcement learning hyper-heuristic framework by fusing the visual information of real-time packing with distributional information of random parameters of the problem. Computational experiments show that our method outperforms the state of the art online methods with reductions in optimality gap between 2%–19% for knapsack problem and 0.7% for the online strip packing problem. In addition, a new visual analysis presentation is also devised to better interpret the learned packing strategies, which can reveal more information than the widely used landscape analysis. As online packing problems are widely available in production environments, the proposed approach can serve as an important reference to solve other similar combinatorial optimisation problems for which visual layout inputs would aid learning.
Chaofan Tu, Ruibin Bai, Uwe Aickelin, Yuchang Zhang, Heshan Du
Expert Syst. Appl.4
2015 MN-ALG: A Data Delivery Algorithm for Large Scale Wireless Electronic Shelf Label System
Yingzhuang Chen, Qifei Zhang 0001, Chaofan Tu, Yuchang Zhang, Yinchao Xue, Sheng Zhang 0016
ICA3PP (1)4