Yuke Wang

Yuke Wang

Auto-generated profile, based on publicly available information

Yuke Wang

Rice University, Houston, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
XCXiaobing Chen
Xiaobing Chen
YWYuke Wang
Yuke Wang
XXXinfeng Xie
Xinfeng Xie
XHXing Hu
Xing Hu
ABAbanti Basak
Abanti Basak
YXYuan Xie
Yuan Xie
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.

17 June 2023
Verified
Conference Paper
Open access
HZHezi Zhang
Hezi Zhang
AWAnbang Wu
Anbang Wu
YWYuke Wang
Yuke Wang
GLGushu Li
Gushu Li
HSHassan Shapourian
Hassan Shapourian
YDYufei Ding
Yufei Ding
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.

12 October 2025
Verified
Conference Paper
Open access
ZHZhengding Hu
Zhengding Hu
VMVibha Murthy
Vibha Murthy
ZPZaifeng Pan
Zaifeng Pan
Wanlu LiWanlu Li
Wanlu Li
XFXiaoyi Fang
Xiaoyi Fang
YWYuke Wang
Yuke Wang

12 October 2025
Verified
Conference Paper
Open access
YGYue Guan
Yue Guan
XQXinwei Qiang
Xinwei Qiang
ZPZaifeng Pan
Zaifeng Pan
DJDaniels Johnson
Daniels Johnson
YFYuanwei Fang
Yuanwei Fang
AAAdnan Aziz
Adnan Aziz

29 June 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YWYuke Wang
Yuke Wang
BFBoyuan Feng
Boyuan Feng
GLGushu Li
Gushu Li
Lei DengLei Deng
Lei Deng
YXYuan Xie
Yuan Xie
YDYufei Ding
Yufei Ding
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.