Machine Learning-Enhanced Greedy Algorithm for Optimizing Hold Time Violations in Advanced Node SoC Designs Article Swipe
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.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.32628/cseit25112387
- https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387
- OA Status
- diamond
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4408256534
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4408256534Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.32628/cseit25112387Digital Object Identifier
- Title
-
Machine Learning-Enhanced Greedy Algorithm for Optimizing Hold Time Violations in Advanced Node SoC DesignsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-03-05Full publication date if available
- Authors
-
Puneet GuptaList of authors in order
- Landing page
-
https://doi.org/10.32628/cseit25112387Publisher landing page
- PDF URL
-
https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387Direct OA link when available
- Concepts
-
Computer science, Greedy algorithm, Node (physics), Algorithm, Artificial intelligence, Engineering, Structural engineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4408256534 |
|---|---|
| doi | https://doi.org/10.32628/cseit25112387 |
| ids.doi | https://doi.org/10.32628/cseit25112387 |
| ids.openalex | https://openalex.org/W4408256534 |
| fwci | 0.0 |
| type | article |
| title | Machine Learning-Enhanced Greedy Algorithm for Optimizing Hold Time Violations in Advanced Node SoC Designs |
| biblio.issue | 2 |
| biblio.volume | 11 |
| biblio.last_page | 610 |
| biblio.first_page | 603 |
| topics[0].id | https://openalex.org/T11032 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9979000091552734 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1708 |
| topics[0].subfield.display_name | Hardware and Architecture |
| topics[0].display_name | VLSI and Analog Circuit Testing |
| topics[1].id | https://openalex.org/T14117 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9973000288009644 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Integrated Circuits and Semiconductor Failure Analysis |
| topics[2].id | https://openalex.org/T12111 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9610000252723694 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Industrial Vision Systems and Defect Detection |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7012889385223389 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C51823790 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6699034571647644 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q504353 |
| concepts[1].display_name | Greedy algorithm |
| concepts[2].id | https://openalex.org/C62611344 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5248104333877563 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1062658 |
| concepts[2].display_name | Node (physics) |
| concepts[3].id | https://openalex.org/C11413529 |
| concepts[3].level | 1 |
| concepts[3].score | 0.45785486698150635 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[3].display_name | Algorithm |
| concepts[4].id | https://openalex.org/C154945302 |
| concepts[4].level | 1 |
| concepts[4].score | 0.3321136236190796 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[4].display_name | Artificial intelligence |
| concepts[5].id | https://openalex.org/C127413603 |
| concepts[5].level | 0 |
| concepts[5].score | 0.10989329218864441 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[5].display_name | Engineering |
| concepts[6].id | https://openalex.org/C66938386 |
| concepts[6].level | 1 |
| concepts[6].score | 0.0 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q633538 |
| concepts[6].display_name | Structural engineering |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7012889385223389 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/greedy-algorithm |
| keywords[1].score | 0.6699034571647644 |
| keywords[1].display_name | Greedy algorithm |
| keywords[2].id | https://openalex.org/keywords/node |
| keywords[2].score | 0.5248104333877563 |
| keywords[2].display_name | Node (physics) |
| keywords[3].id | https://openalex.org/keywords/algorithm |
| keywords[3].score | 0.45785486698150635 |
| keywords[3].display_name | Algorithm |
| keywords[4].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[4].score | 0.3321136236190796 |
| keywords[4].display_name | Artificial intelligence |
| keywords[5].id | https://openalex.org/keywords/engineering |
| keywords[5].score | 0.10989329218864441 |
| keywords[5].display_name | Engineering |
| language | en |
| locations[0].id | doi:10.32628/cseit25112387 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210200847 |
| locations[0].source.issn | 2456-3307 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2456-3307 |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| locations[0].landing_page_url | https://doi.org/10.32628/cseit25112387 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5084229134 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-6188-1134 |
| authorships[0].author.display_name | Puneet Gupta |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | None Puneet Gupta |
| authorships[0].is_corresponding | True |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Machine Learning-Enhanced Greedy Algorithm for Optimizing Hold Time Violations in Advanced Node SoC Designs |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11032 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9979000091552734 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1708 |
| primary_topic.subfield.display_name | Hardware and Architecture |
| primary_topic.display_name | VLSI and Analog Circuit Testing |
| related_works | https://openalex.org/W4387497383, https://openalex.org/W3183948672, https://openalex.org/W3173606202, https://openalex.org/W3110381201, https://openalex.org/W2948807893, https://openalex.org/W2899084033, https://openalex.org/W2778153218, https://openalex.org/W2758277628, https://openalex.org/W2748952813, https://openalex.org/W1531601525 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.32628/cseit25112387 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210200847 |
| best_oa_location.source.issn | 2456-3307 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2456-3307 |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| best_oa_location.landing_page_url | https://doi.org/10.32628/cseit25112387 |
| primary_location.id | doi:10.32628/cseit25112387 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210200847 |
| primary_location.source.issn | 2456-3307 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2456-3307 |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://ijsrcseit.com/index.php/home/article/download/CSEIT25112387/CSEIT25112387 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| primary_location.landing_page_url | https://doi.org/10.32628/cseit25112387 |
| publication_date | 2025-03-05 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 16, 50 |
| abstract_inverted_index.an | 3 |
| abstract_inverted_index.by | 48 |
| abstract_inverted_index.in | 11, 25, 104, 135, 147 |
| abstract_inverted_index.of | 83, 124, 132, 137 |
| abstract_inverted_index.on | 32 |
| abstract_inverted_index.to | 6 |
| abstract_inverted_index.The | 20, 40, 93, 118 |
| abstract_inverted_index.and | 36, 64, 74, 107, 128, 142 |
| abstract_inverted_index.for | 86 |
| abstract_inverted_index.how | 96 |
| abstract_inverted_index.the | 78, 122, 133 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.also | 120 |
| abstract_inverted_index.area | 65, 140 |
| abstract_inverted_index.cell | 57 |
| abstract_inverted_index.hold | 8, 87 |
| abstract_inverted_index.that | 54 |
| abstract_inverted_index.this | 97 |
| abstract_inverted_index.time | 9 |
| abstract_inverted_index.(SoC) | 28 |
| abstract_inverted_index.clock | 38 |
| abstract_inverted_index.delay | 56 |
| abstract_inverted_index.nodes | 14 |
| abstract_inverted_index.power | 34, 62, 138 |
| abstract_inverted_index.terms | 136 |
| abstract_inverted_index.using | 15 |
| abstract_inverted_index.while | 59, 110 |
| abstract_inverted_index.FinFET | 106 |
| abstract_inverted_index.across | 89, 114 |
| abstract_inverted_index.active | 75 |
| abstract_inverted_index.common | 84 |
| abstract_inverted_index.design | 101, 144, 150 |
| abstract_inverted_index.fixing | 88 |
| abstract_inverted_index.greedy | 17 |
| abstract_inverted_index.modern | 26, 148 |
| abstract_inverted_index.paths. | 92 |
| abstract_inverted_index.points | 85 |
| abstract_inverted_index.timing | 45, 91, 112 |
| abstract_inverted_index.Through | 67 |
| abstract_inverted_index.article | 1, 21, 94, 119 |
| abstract_inverted_index.closure | 46, 102, 145 |
| abstract_inverted_index.complex | 33 |
| abstract_inverted_index.domains | 35 |
| abstract_inverted_index.enables | 80 |
| abstract_inverted_index.machine | 69 |
| abstract_inverted_index.methods | 47 |
| abstract_inverted_index.overall | 143 |
| abstract_inverted_index.process | 53 |
| abstract_inverted_index.various | 115 |
| abstract_inverted_index.advanced | 12, 68, 105 |
| abstract_inverted_index.analysis | 131 |
| abstract_inverted_index.approach | 5, 79 |
| abstract_inverted_index.benefits | 134 |
| abstract_inverted_index.critical | 23 |
| abstract_inverted_index.designs, | 29 |
| abstract_inverted_index.explores | 121 |
| abstract_inverted_index.focusing | 31 |
| abstract_inverted_index.improves | 100 |
| abstract_inverted_index.learning | 70, 76 |
| abstract_inverted_index.multiple | 37, 90 |
| abstract_inverted_index.physical | 149 |
| abstract_inverted_index.presents | 2, 129 |
| abstract_inverted_index.proposed | 41 |
| abstract_inverted_index.regions. | 39 |
| abstract_inverted_index.transfer | 73 |
| abstract_inverted_index.addresses | 22 |
| abstract_inverted_index.algorithm | 18 |
| abstract_inverted_index.efficient | 81 |
| abstract_inverted_index.including | 72 |
| abstract_inverted_index.insertion | 58 |
| abstract_inverted_index.integrity | 113 |
| abstract_inverted_index.operating | 116 |
| abstract_inverted_index.optimizes | 55 |
| abstract_inverted_index.resolving | 7 |
| abstract_inverted_index.challenges | 24 |
| abstract_inverted_index.efficiency | 103, 146 |
| abstract_inverted_index.innovative | 4 |
| abstract_inverted_index.reduction, | 139 |
| abstract_inverted_index.strategies | 127 |
| abstract_inverted_index.systematic | 51 |
| abstract_inverted_index.technology | 13 |
| abstract_inverted_index.violations | 10 |
| abstract_inverted_index.workflows. | 151 |
| abstract_inverted_index.algorithms, | 77 |
| abstract_inverted_index.conditions. | 117 |
| abstract_inverted_index.congestion, | 61 |
| abstract_inverted_index.considering | 60 |
| abstract_inverted_index.maintaining | 111 |
| abstract_inverted_index.methodology | 42, 98 |
| abstract_inverted_index.techniques, | 71 |
| abstract_inverted_index.traditional | 44 |
| abstract_inverted_index.consumption, | 63 |
| abstract_inverted_index.demonstrates | 95 |
| abstract_inverted_index.implementing | 49 |
| abstract_inverted_index.methodology. | 19 |
| abstract_inverted_index.optimization | 126 |
| abstract_inverted_index.particularly | 30 |
| abstract_inverted_index.technologies | 109 |
| abstract_inverted_index.utilization. | 66 |
| abstract_inverted_index.comprehensive | 130 |
| abstract_inverted_index.optimization, | 141 |
| abstract_inverted_index.significantly | 99 |
| abstract_inverted_index.System-on-Chip | 27 |
| abstract_inverted_index.identification | 82 |
| abstract_inverted_index.implementation | 123 |
| abstract_inverted_index.revolutionizes | 43 |
| abstract_inverted_index.Gate-All-Around | 108 |
| abstract_inverted_index.decision-making | 52 |
| abstract_inverted_index.congestion-aware | 125 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5084229134 |
| countries_distinct_count | 0 |
| institutions_distinct_count | 1 |
| citation_normalized_percentile.value | 0.07002475 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |