Yuke Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yuke Wang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Yufei Ding
University of California San Diego
5 shared publications - Gushu Li
University of Pennsylvania, Philadelphia, USA
2 shared publications - Lei Deng
School of Computer Science and Engineering, Central South University , Changsha 410083
2 shared publications - Wan-Lu Li
University of California, San Diego
2 shared publications - Yuan Xie
The Hong Kong University of Science and Technology, Hong Kong, Hong Kong
2 shared publications - Zaifeng Pan
UCSD, La Jolla, USA
2 shared publications
Latest Publications
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 522-536
MixFusion: A Patch-Level Parallel Serving System for Mixed-Resolution Diffusion Models
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 522-536
Open AccessMixFusion: A Patch-Level Parallel Serving System for Mixed-Resolution Diffusion Models
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 623-638
HedraRAG: Co-Optimizing Generation and Retrieval for Heterogeneous RAG Workflows
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 623-638
Open AccessHedraRAG: Co-Optimizing Generation and Retrieval for Heterogeneous RAG Workflows
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1046-1061
Mercury: Unlocking Multi-GPU Operator Optimization for LLMs via Remote Memory Scheduling
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1046-1061
Open AccessMercury: Unlocking Multi-GPU Operator Optimization for LLMs via Remote Memory Scheduling
- Open Access
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
OneQ: A Compilation Framework for Photonic One-Way Quantum Computation
In this paper, we propose OneQ, the first optimizing compilation framework for one-way quantum computation towards realistic photonic quantum architectures. Unlike previous compilation efforts for solid-state qubit technologies, our innovative framework addresses a unique set of challenges in photonic quantum computing. Specifically, this includes the dynamic generation of qubits over time, the need to perform all computation through measurements instead of relying on 1-qubit and 2-qubit gates, and the fact that photons are instantaneously destroyed after measurements. As pioneers in this field, we demonstrate the vast optimization potential of photonic one-way quantum computing, showcasing the remarkable ability of OneQ to reduce computing resource requirements by orders of magnitude.
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessOneQ: A Compilation Framework for Photonic One-Way Quantum Computation
In this paper, we propose OneQ, the first optimizing compilation framework for one-way quantum computation towards realistic photonic quantum architectures. Unlike previous compilation efforts for solid-state qubit technologies, our innovative framework addresses a unique set of challenges in photonic quantum computing. Specifically, this includes the dynamic generation of qubits over time, the need to perform all computation through measurements instead of relying on 1-qubit and 2-qubit gates, and the fact that photons are instantaneously destroyed after measurements. As pioneers in this field, we demonstrate the vast optimization potential of photonic one-way quantum computing, showcasing the remarkable ability of OneQ to reduce computing resource requirements by orders of magnitude.
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (5) , 1358-1370
STPAcc: Structural TI-Based Pruning for Accelerating Distance-Related Algorithms on CPU-FPGA Platforms
As a promising solution to boost the performance of distance-related algorithms (e.g.,$K$ -means and KNN), FPGA-based acceleration attracts lots of attention, but also comes with numerous challenges. In this work, we propose, STPAcc , an optimization framework based on structural triangle-inequality (TI)-based pruning (STP) for accelerating distance-related algorithms on CPU-FPGA platforms. STPAcc provides a domain-specific language to unify distance-related algorithms effectively, a structural TI-based pruning strategy to remove unnecessary distance computations, a coarse-grained workload partitioning and mapping strategy to fully exploit the potentials of the CPU-FPGA platform, and fine-grained hardware optimizations to further improve performance on the FPGA. Intensive experiments show that STPAcc designs achieve$31.42\times $ speedup and$99.63\times $ better energy efficiency on average over standard CPU-based implementations.- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (5) , 1358-1370
STPAcc: Structural TI-Based Pruning for Accelerating Distance-Related Algorithms on CPU-FPGA Platforms
As a promising solution to boost the performance of distance-related algorithms (e.g.,$K$ -means and KNN), FPGA-based acceleration attracts lots of attention, but also comes with numerous challenges. In this work, we propose, STPAcc , an optimization framework based on structural triangle-inequality (TI)-based pruning (STP) for accelerating distance-related algorithms on CPU-FPGA platforms. STPAcc provides a domain-specific language to unify distance-related algorithms effectively, a structural TI-based pruning strategy to remove unnecessary distance computations, a coarse-grained workload partitioning and mapping strategy to fully exploit the potentials of the CPU-FPGA platform, and fine-grained hardware optimizations to further improve performance on the FPGA. Intensive experiments show that STPAcc designs achieve$31.42\times $ speedup and$99.63\times $ better energy efficiency on average over standard CPU-based implementations.- 11 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (4) , 936-949
Rubik: A Hierarchical Architecture for Efficient Graph Neural Network Training
The graph convolutional network (GCN) emerges as a promising direction to learn the inductive representation in graph data commonly used in widespread applications, such as E-commerce, social networks, and knowledge graphs. However, learning from graphs is nontrivial because of its mixed computation model involving both graph analytics and neural network computing. To this end, we decompose the GCN learning into two hierarchical paradigms: 1) graph-level and 2) node-level computing. Such a hierarchical paradigm facilitates the software and hardware accelerations for GCN learning. We propose a lightweight graph reordering methodology, incorporated with a GCN accelerator architecture that equips a customized cache design to fully utilize the graph-level data reuse. We also propose a mapping methodology aware of data reuse and task-level parallelism to handle various graphs inputs effectively. The results show that Rubik accelerator design improves energy efficiency by$26.3\times $ –$1375.2\times $ than GPU platforms across different datasets and GCN models.- 11 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (4) , 936-949
Rubik: A Hierarchical Architecture for Efficient Graph Neural Network Training
The graph convolutional network (GCN) emerges as a promising direction to learn the inductive representation in graph data commonly used in widespread applications, such as E-commerce, social networks, and knowledge graphs. However, learning from graphs is nontrivial because of its mixed computation model involving both graph analytics and neural network computing. To this end, we decompose the GCN learning into two hierarchical paradigms: 1) graph-level and 2) node-level computing. Such a hierarchical paradigm facilitates the software and hardware accelerations for GCN learning. We propose a lightweight graph reordering methodology, incorporated with a GCN accelerator architecture that equips a customized cache design to fully utilize the graph-level data reuse. We also propose a mapping methodology aware of data reuse and task-level parallelism to handle various graphs inputs effectively. The results show that Rubik accelerator design improves energy efficiency by$26.3\times $ –$1375.2\times $ than GPU platforms across different datasets and GCN models.