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

Heyang Huang

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

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 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
Cloud and datacenter computing · 30% Hardware accelerators and domain-specific architectures · 23% Parallel and multicore computing · 23%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › task scheduling
accelerator scheduling
0.912025
ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads · ACM Trans. Archit. Code Optim. 2025
Cloud and datacenter computing
inference serving
0.912025
ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads · ACM Trans. Archit. Code Optim. 2025
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN inference
LLM inference
0.912025
ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads · ACM Trans. Archit. Code Optim. 2025
GPUs and heterogeneous computing
prefill-decode disaggregation
0.912025
ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads · ACM Trans. Archit. Code Optim. 2025
Cloud and datacenter computing
request scheduling
0.312025
ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads · ACM Trans. Archit. Code Optim. 2025

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

two-level scheduling · 0.9resource usage prediction · 0.9
YearPublicationVenuePosition
2025 Blockchain-Driven Distributed Edge Intelligence for Enhanced Internet of Vehicles
abstract
In the evolving landscape of vehicular networks, it is crucial to ensure robust security and efficient data handling. In this work, we introduce a novel federated learning (FL) algorithm integrated within a distributed edge intelligence (DEI) framework, enhanced by a blockchain consensus mechanism, specifically designed for Internet of Vehicles (IoV) to enhance data privacy, efficiency, and system resilience. Motivated by the pressing need for improved data privacy and security in the IoV, our approach can not only prioritize these aspects but also enhance the efficiency and accuracy of distributed machine learning. The proposed consensus mechanism, by integrating Proof-of-Knowledge (PoK) with practical Byzantine fault tolerance (PBFT), is crafted to be lightweight, making it suitable for the dynamic and resource-constrained vehicular environments. Our evaluation findings demonstrate the algorithm’s superior performance and scalability, suggesting its applicability in diverse IoV scenarios and its potential to facilitate secure, robust, and efficient collaborative learning.
Xiaofu Chen, Weizhi Meng 0001, Heyang Huang
IEEE Internet Things J.3
2025 ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads
abstract
Transformer-based large language model (LLM) inference serving is now the backbone of many cloud services. LLM inference consists of a prefill phase and a decode phase. However, existing LLM deployment practices often overlook the distinct characteristics of these phases, leading to significant interference. To mitigate interference, our insight is to carefully schedule and group inference requests based on their characteristics. We realize this idea in ShuffleInfer through three pillars. First, it partitions prompts into fixed-size chunks so that the accelerator always runs close to its computation-saturated limit. Second, it disaggregates prefill and decode instances so each can run independently. Finally, it uses a smart two-level scheduling algorithm augmented with predicted resource usage to avoid decode scheduling hotspots. Results show that ShuffleInfer improves time-to-first-token (TTFT), job completion time (JCT), and inference efficiency in terms of performance per dollar by a large margin, e.g., it uses 38% less resources all the while lowering average TTFT and average JCT by 97% and 47%, respectively.
Cunchen Hu, Heyang Huang, Liangliang Xu, Xusheng Chen, Chenxi Wang 0005, Sa Wang, Yungang Bao, Ninghui Sun, Yizhou Shan
ACM Trans. Archit. Code Optim.2