Machine Learning-Enhanced Greedy Algorithm for Optimizing Hold Time Violations in Advanced Node SoC Designs
DOI:
https://doi.org/10.32628/CSEIT25112387Keywords:
Hold Time Optimization, Greedy Algorithm, System-on-Chip Design, Machine Learning in VLSI, Physical Design ImplementationAbstract
This article presents an innovative approach to resolving hold time violations in advanced technology nodes using a greedy algorithm methodology. The article addresses critical challenges in modern System-on-Chip (SoC) designs, particularly focusing on complex power domains and multiple clock regions. The proposed methodology revolutionizes traditional timing closure methods by implementing a systematic decision-making process that optimizes delay cell insertion while considering congestion, power consumption, and area utilization. Through advanced machine learning techniques, including transfer and active learning algorithms, the approach enables efficient identification of common points for hold fixing across multiple timing paths. The article demonstrates how this methodology significantly improves design closure efficiency in advanced FinFET and Gate-All-Around technologies while maintaining timing integrity across various operating conditions. The article also explores the implementation of congestion-aware optimization strategies and presents comprehensive analysis of the benefits in terms of power reduction, area optimization, and overall design closure efficiency in modern physical design workflows.
Downloads
References
Takshila VLSI, "Timing Closure in Physical Design: Best Practices," Takshila VLSI, 2024. [Online]. Available: www.takshila-vlsi.com/timing-closure-in-physical-design-best-practices/
VamshiKanth Reddy, "Driving VLSI Design Efficiency with AI: Advanced Optimization Methods," AI-Enabled Optimization Techniques in VLSI Design, 2024. https://vlsifirst.com/blog/ai-enabled-optimization-techniques-in-vlsi-design
Jay Roy, "Improving Power System Optimization in SoC Designs," 2021. [Online]. https://www.synopsys.com/blogs/chip-design/improved-power-system-optimization-soc-designs.html
L. Shanthala et al., "Efficient Timing Closure in SOC through Timing Quality Checks and Engineering Change Order," International Journal of VLSI Design, 2023. https://www.ijariit.com/manuscripts/v3i3/V3I3-1401.pdf
Medium, "Greedy Algorithms: Strategies for Optimization," Beyond Verse, 2023. [Online]. https://medium.com/@beyond_verse/greedy-algorithms-strategies-for-optimization-1221ee4d0ce0
Global Scientific, "Timing Optimization Technique's for Controller's Architecture," 2021. https://www.globalscientificjournal.com/researchpaper/Timing_Optimization_Technique_s_for_Controller_s_Architecture.pdf
anysilicon, "SoC Design Overview," AnySilicon Technical Library, 2024. [Online]. https://anysilicon.com/soc-design-overview/
Wei W. Xing et al.,"TOTAL: Multi-Corners Timing Optimization Based on Transfer and Active Learning,"2023. https://ieeexplore.ieee.org/document/10247914
Nalin Gupta & Gaurav Goya, "Hold Fixing Techniques," Design Reuse. [Online]. https://www.design-reuse.com/articles/38949/hold-fixing-techniques.html
Bitsilica, "Congestion and Timing Optimization Techniques in VLSI Physical Design," 2024. https://bitsilica.com/congestion-and-timing-optimization-techniques-in-vlsi-physical-design/
Wen Chen, "Challenges and Trends in Modern SoC Design Verification," ResearchGate Publication, 2017. https://www.researchgate.net/publication/318890041_Challenges_and_Trends_in_Modern_SoC_Design_Verification
Ramalinga Reddy Kotapati, "Physical Design Evolution and Implementation Strategies for Advanced FinFET and Gate-All-Around Technologies: A Comprehensive Review," 2024. https://www.researchgate.net/publication/387583328_PHYSICAL_DESIGN_EVOLUTION_AND_IMPLEMENTATION_STRATEGIES_FOR_ADVANCED_FINFET_AND_GATE-ALL-AROUND_TECHNOLOGIES_A_COMPREHENSIVE_REVIEW
Downloads
Published
Issue
Section
License
Copyright (c) 2025 International Journal of Scientific Research in Computer Science, Engineering and Information Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.