Demo Data from EDBT 2026 / reviewers in the wild / expert
Boyu Zhang 0001
dblp:10/10956-1
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-4094-3017ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
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.
| Network and information security
1 paper |
Hardware security and side channels · 50% Privacy and data protection · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels
integrated circuit security |
0.3 | 1 | 2018 | Analysis of security of split manufacturing using machine learning · DAC 2018 |
Privacy and data protection › inference attack
neighborhood attack |
0.3 | 1 | 2018 | Analysis of security of split manufacturing using machine learning · DAC 2018 |
Electronic design automation
physical design |
0.1 | 1 | 2018 | Analysis of security of split manufacturing using machine learning · DAC 2018 |
Electronic design automation › physical design
VLSI layout |
0.1 | 1 | 2018 | Analysis of security of split manufacturing using machine learning · DAC 2018 |
Methods — techniques the papers use, named apart from their topics
machine learning · 0.7feature ranking · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Analysis of Security of Split Manufacturing Using Machine LearningabstractThis paper is the first to analyze the security of split manufacturing using machine learning (ML), based on data collected from layouts provided by industry, with eight routing metal layers and significant variation in wire size and routing congestion across the layers. Many types of layout features are considered in our ML model, including those obtained from placement, routing, and cell sizes. Since the runtime cost of our basic ML procedure becomes prohibitively large for lower layers, we propose novel techniques to make it scalable with little sacrifice in the effectiveness of the attack. Moreover, we further improve the performance in the top routing layer by making use of higher quality training samples and by exploiting the routing convention. We also propose a validation-based proximity attack procedure, which generally outperforms our recent prior work. In the experiments, we analyze the ranking of the features used in our ML model and show how features vary in importance when moving to the lower layers. We provide comprehensive evaluation and comparison of our model with different configurations and demonstrate dramatically better performance of attacks compared to the prior work. Wei Zeng 0015, Boyu Zhang 0001, Azadeh Davoodi |
IEEE Trans. Very Large Scale Integr. Syst. | 2 |
| 2018 | Exploring energy and accuracy tradeoff in structure simplification of trained deep neural networksabstractThis paper presents a structure simplification procedure that allows efficient energy and accuracy tradeoffs in implementation of trained deep neural networks (DNNs). This structure simplification procedure identifies and eliminates redundant neurons in any layer of the DNN based on the trained weights connected from these neurons. This procedure may be applied to all layers of a DNN. For each layer different configurations with Pareto-optimal accuracy and energy consumption are realized. Our work is the first to use energy-accuracy trade-offs to guide optimal structure realization of trained DNNs. After redundant neurons are discarded, the weights of remaining neurons will be updated using matrix multiplication without retraining. Yet, retraining may still be applied if desired to further fine tune the performance. In our experiments, we show energy-accuracy tradeoff provides clear guidance to achieve efficient realization of trained DNNs. We also observe significant implementation cost reductions with up to 33X in energy and 12X in memory while the performance (accuracy) loss is negligible. Boyu Zhang 0001, Azadeh Davoodi, Yu Hen Hu |
ASP-DAC | 1 |
| 2018 | Analysis of security of split manufacturing using machine learningabstractThis work is the first to analyze the security of split manufacturing using machine learning, based on data collected from layouts provided by industry, with 8 routing metal layers, and significant variation in wire size and routing congestion across the layers. We consider many types of layout features for machine learning including those obtained from placement, routing, and cell sizes. For the top split layer, we demonstrate dramatically better results in proximity attack compared to a recent prior work. We analyze the ranking of the features used by machine learning and show the importance of how features vary when moving to the lower layers. Since the runtime of our basic machine learning becomes prohibitively large for lower layers, we propose novel techniques to make it scalable with little sacrifice in effectiveness of the attack. Boyu Zhang 0001, Jonathon Magaña, Azadeh Davoodi |
DAC | 1 |
| 2018 | A Comparative Study of Local Net Modeling Using Machine LearningabstractLocal nets are by default ignored during global routing but can contribute to a high percentage (up to 30%) of total number of nets in the design. Prior work proposed simple models for how local nets are routed and showed benefits such as better congestion analysis post-placement, integration with global routing, and better track assignment. In this work we study local net modeling using machine learning. Our model predicts utilization by local routes inside each global cell. We model this as a regression problem and as reference use local route utilization data from the detailed routing stage using a commercial tool. To solve the problem we identify suitable machine learning algorithms. Within our modeling, we study and rank different features which utilize various layout attributes. We identify the most beneficial features and show our model performs superior to prior work which were based on pin density and Steiner tree models. Our model also performs better for the subset of local nets which are routed in more than one global cell. Jackson Melchert, Boyu Zhang 0001, Azadeh Davoodi |
ACM Great Lakes Symposium on VLSI | 2 |
| 2017 | Technology mapping with all spin logicabstractThis work is the first to propose a technology mapping algorithm for All Spin Logic (ASL) device. The ASL is the most actively-pursed one among spintronic devices which themselves fall under emerging post-CMOS nano-technologies. We identify the shortcomings of directly applying classical technology mapping with ASL devices, and propose techniques to extend it to handle these shortcomings. Our results show that our ASL-aware technology mapping algorithm can achieve on-average 9.15% and up to 27.27% improvement in delay (when optimizing delay) with slight improvement in area, compared to the solution generated by classical technology mapping. In a broader sense, our results show the need for developing circuit-level CAD tools that are aware of and optimized for emerging nano-technologies in order to better assess their promise as we move to the post-CMOS era. Boyu Zhang 0001, Azadeh Davoodi |
DATE | 1 |