Shunyao Huang

Shunyao Huang

Auto-generated profile, based on publicly available information

Shunyao Huang

University of Southern California, Los Angeles, California, USA

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
5 August 2026
Verified
Conference Paper
Open access
PCPaul (Yi-Chia) Chen
Paul (Yi-Chia) Chen
JKJeongeun Kim
Jeongeun Kim
WZWenbo Zhu
Wenbo Zhu
YLYuanhan Li
Yuanhan Li
SHShunyao Huang
Shunyao Huang
CTChristopher Torng
Christopher Torng
Edge AI systems operate under stringent energy and volume constraints, demanding extreme efficiency on limited battery capacity, with requirements worsening as intelligent capabilities advance. Prior work suggests fine-grained power orchestration through DVFS and power gating significantly improves efficiency critical to meeting such constraints, but introduces new challenges. We observe that layer-level approaches incur unintended overheads due to inter-layer coupling of power-control decisions, and jointly managing these mechanisms under limited voltage rails and transition overheads leads to a rapidly growing combinatorial schedule space. We propose PowerFlow-DNN, a compiler-directed framework for end-to-end power-state orchestration in ultra-low-power accelerators. By constructing a rigorous problem formulation for deadline-constrained, real-time, periodic inference as a unified inter-layer power-scheduling problem, our framework discovers energy-minimal power-state schedules while accounting for inter-layer impacts. We evaluate the framework on a DNN accelerator VLSI implementation in TSMC 40nm technology. Across representative edge networks, our approach discovers near-optimal solutions and achieves energy within 0.04% of the exact ILP oracle, reducing energy by up to 48% compared to an aggressive baseline without power orchestration, while reasoning over a combinatorial schedule space of over 10160 possible power-state assignments, yet operating on a structured layered state graph that enables efficient optimization, achieving up to 2.14× solver speedup via lightweight pruning.