Hai Zhou

Hai Zhou


Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
24 December 2022 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
YLYiting Liu
Yiting Liu
ZJZiyi Ju
Ziyi Ju
ZLZhengming Li
Zhengming Li
MDMingzhi Dong
Mingzhi Dong
HZHai Zhou
Hai Zhou
LSLi Shang
Li Shang
Chip floorplanning has long been a critical task with high computation complexity in the physical implementation of VLSI chips. Its key objective is to determine the initial locations of large chip modules with minimized wirelength while adhering to the density constraint, which in essence is a process of constructing an optimized mapping from circuit connectivity to physical locations. Proven to be an NP-hard problem, chip floorplanning is difficult to be solved efficiently using algorithmic approaches. This article presents GraphPlanner, a variational graph-convolutional-network-based deep learning technique for chip floorplanning. GraphPlanner is able to learn an optimized and generalized mapping between circuit connectivity and physical wirelength and produce a chip floorplan using efficient model inference. GraphPlanner is further equipped with an efficient clustering method, a unification of hyperedge coarsening with graph spectral clustering, to partition a large-scale netlist into high-quality clusters with minimized inter-cluster weighted connectivity. GraphPlanner has been integrated with two state-of-the-art mixed-size placers. Experimental studies using both academic benchmarks and industrial designs demonstrate that compared to state-of-the-art mixed-size placers alone, GraphPlanner improves placement runtime by 25% with 4% wirelength reduction on average.

27 October 2024
Verified
Conference Paper
Open access
YLYiting Liu
Yiting Liu
HZHai Zhou
Hai Zhou
JWJia Wang
Jia Wang
FYFan Yang
Fan Yang
XZXuan Zeng
Xuan Zeng
LSLi Shang
Li Shang

20 November 2006 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
Ruimin ChenRuimin Chen
Ruimin Chen
HZHai Zhou
Hai Zhou
Dynamic programming is a useful technique to handle slicing floorplan, technology mapping, and buffering problems, where many maxplus merge operations of solution lists are needed. Shi proposed an efficient O(nlogn) time algorithm to speed up the merge operation. Based on balanced binary search trees, his algorithm showed superb performance with the most unbalanced sizes of merging solution lists. The authors propose in this paper a more efficient data structure for the merge operations. With parameters to adjust adaptively, their algorithm works better than Shi's under all cases, unbalanced, balanced, and mix sizes. Their data structure is also simpler

20 January 2003
Verified
Conference Paper
Closed access
ILI-Min Liu
I-Min Liu
AAA. Aziz
A. Aziz
DWD.F. Wong
D.F. Wong
HZHai Zhou
Hai Zhou

23 June 2024
Verified
Conference Paper
Open access
YLYou Li
You Li
GZGuannan Zhao
Guannan Zhao
YHYunqi He
Yunqi He
HZHai Zhou
Hai Zhou
Deep neural networks are susceptible to model piracy and adversarial attacks when malicious end-users have full access to the model parameters. Recently, a logic locking scheme called HPNN has been proposed. HPNN utilizes hardware root-of-trust to prevent end-users from accessing the model parameters. This paper investigates whether logic locking is secure on deep neural networks. Specifically, it presents a systematic I/O attack that combines algebraic and learning-based approaches. This attack incrementally extracts key values from the network to minimize sample complexity. Besides, it employs a rigorous procedure to ensure the correctness of the extracted key values. Our experiments demonstrate the accuracy and efficiency of this attack on large networks with complex architectures. Consequently, we conclude that HPNN-style logic locking and its variants we can foresee are insecure on deep neural networks.

1 January 2000
Verified
Conference Paper
Open access
HZHai Zhou
Hai Zhou
DWD. F. Wong
D. F. Wong