Robust chip-level clock tree synthesis for SOC designs

A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to different IPs per chip specifications. A primary requirement of CCTS is to balance the sub-clock-trees belonging to different I...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rajaram, Anand, Pan, David Z.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 723
container_issue
container_start_page 720
container_title
container_volume
creator Rajaram, Anand
Pan, David Z.
description A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to different IPs per chip specifications. A primary requirement of CCTS is to balance the sub-clock-trees belonging to different IPs such that the entire tree has a small skew across all process corners. This helps in timing closure across all the design corners. Another important requirement of CCTS is to reduce clock divergence between IPs that have critical timing paths between them, thereby reducing maximum possible clock skew in the critical paths and thus improves yield. In this work, we propose effective CCTS algorithms to simultaneously reduce multi-corner skew and clock divergence. To the best of our knowledge, this is the first work that attempts to solve this practically important problem. Experimental results on several testcases indicate that our methods achieve 10%-31%(20% on average) clock divergence reduction and between 16--64ps skew reduction (1.6%-6.4% of cycle time for a 1GHz clock) with less than 0.5% increase in buffer area/wirelength compared to existing CTS algorithms.
doi_str_mv 10.1145/1391469.1391654
format Conference Proceeding
fullrecord <record><control><sourceid>acm_6IE</sourceid><recordid>TN_cdi_acm_books_10_1145_1391469_1391654_brief</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4555913</ieee_id><sourcerecordid>acm_books_10_1145_1391469_1391654</sourcerecordid><originalsourceid>FETCH-LOGICAL-a177t-6e8cdc189484c40e1a0b8e437b7a3fd610e705bb59c1d6218ee6b3383ec76a6a3</originalsourceid><addsrcrecordid>eNqNkDtLA0EUhQc0YIypLWymtNl4b-ZdSvAFgYAPsBtmZu-aNZts2FmF_HsTkh9gdTicj1N8jF0jTBClukPhUGo3OaRW8oxdogalLKLCczYEI2yBAJ8DNrSq0FK6qbxg45y_AQBR2Kl0Q6Zf2_iTe56W9bZo6Jcanpo2rXjfEfG82_RLynXmVdvxt8WMl_v2tclXbFCFJtP4lCP28fjwPnsu5ounl9n9vAhoTF9osqlMaJ20MkkgDBAtSWGiCaIqNQIZUDEql7DUU7REOgphBSWjgw5ixG6OvzUR-W1Xr0O381Ip5VDs19vjGtLax7ZdZY_gD3b8yY4_2dmjk3-iPnY1VeIPmzNfpQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Robust chip-level clock tree synthesis for SOC designs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Rajaram, Anand ; Pan, David Z.</creator><creatorcontrib>Rajaram, Anand ; Pan, David Z.</creatorcontrib><description>A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to different IPs per chip specifications. A primary requirement of CCTS is to balance the sub-clock-trees belonging to different IPs such that the entire tree has a small skew across all process corners. This helps in timing closure across all the design corners. Another important requirement of CCTS is to reduce clock divergence between IPs that have critical timing paths between them, thereby reducing maximum possible clock skew in the critical paths and thus improves yield. In this work, we propose effective CCTS algorithms to simultaneously reduce multi-corner skew and clock divergence. To the best of our knowledge, this is the first work that attempts to solve this practically important problem. Experimental results on several testcases indicate that our methods achieve 10%-31%(20% on average) clock divergence reduction and between 16--64ps skew reduction (1.6%-6.4% of cycle time for a 1GHz clock) with less than 0.5% increase in buffer area/wirelength compared to existing CTS algorithms.</description><identifier>ISSN: 0738-100X</identifier><identifier>ISBN: 1605581151</identifier><identifier>ISBN: 9781605581156</identifier><identifier>DOI: 10.1145/1391469.1391654</identifier><identifier>LCCN: 85-644924</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Algorithm design and analysis ; Chip-level CTS ; Clock Network ; Clocks ; Delay ; Hardware -- Electronic design automation -- Physical design (EDA) ; Merging ; Physical Design ; Registers ; Robustness ; System-on-a-chip ; Testing ; Timing ; Very large scale integration</subject><ispartof>2008 45th ACM/IEEE Design Automation Conference, 2008, p.720-723</ispartof><rights>2008 ACM</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4555913$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,792,2052,27902,54733,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4555913$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rajaram, Anand</creatorcontrib><creatorcontrib>Pan, David Z.</creatorcontrib><title>Robust chip-level clock tree synthesis for SOC designs</title><title>2008 45th ACM/IEEE Design Automation Conference</title><addtitle>DAC</addtitle><description>A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to different IPs per chip specifications. A primary requirement of CCTS is to balance the sub-clock-trees belonging to different IPs such that the entire tree has a small skew across all process corners. This helps in timing closure across all the design corners. Another important requirement of CCTS is to reduce clock divergence between IPs that have critical timing paths between them, thereby reducing maximum possible clock skew in the critical paths and thus improves yield. In this work, we propose effective CCTS algorithms to simultaneously reduce multi-corner skew and clock divergence. To the best of our knowledge, this is the first work that attempts to solve this practically important problem. Experimental results on several testcases indicate that our methods achieve 10%-31%(20% on average) clock divergence reduction and between 16--64ps skew reduction (1.6%-6.4% of cycle time for a 1GHz clock) with less than 0.5% increase in buffer area/wirelength compared to existing CTS algorithms.</description><subject>Algorithm design and analysis</subject><subject>Chip-level CTS</subject><subject>Clock Network</subject><subject>Clocks</subject><subject>Delay</subject><subject>Hardware -- Electronic design automation -- Physical design (EDA)</subject><subject>Merging</subject><subject>Physical Design</subject><subject>Registers</subject><subject>Robustness</subject><subject>System-on-a-chip</subject><subject>Testing</subject><subject>Timing</subject><subject>Very large scale integration</subject><issn>0738-100X</issn><isbn>1605581151</isbn><isbn>9781605581156</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNqNkDtLA0EUhQc0YIypLWymtNl4b-ZdSvAFgYAPsBtmZu-aNZts2FmF_HsTkh9gdTicj1N8jF0jTBClukPhUGo3OaRW8oxdogalLKLCczYEI2yBAJ8DNrSq0FK6qbxg45y_AQBR2Kl0Q6Zf2_iTe56W9bZo6Jcanpo2rXjfEfG82_RLynXmVdvxt8WMl_v2tclXbFCFJtP4lCP28fjwPnsu5ounl9n9vAhoTF9osqlMaJ20MkkgDBAtSWGiCaIqNQIZUDEql7DUU7REOgphBSWjgw5ixG6OvzUR-W1Xr0O381Ip5VDs19vjGtLax7ZdZY_gD3b8yY4_2dmjk3-iPnY1VeIPmzNfpQ</recordid><startdate>20080608</startdate><enddate>20080608</enddate><creator>Rajaram, Anand</creator><creator>Pan, David Z.</creator><general>ACM</general><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20080608</creationdate><title>Robust chip-level clock tree synthesis for SOC designs</title><author>Rajaram, Anand ; Pan, David Z.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a177t-6e8cdc189484c40e1a0b8e437b7a3fd610e705bb59c1d6218ee6b3383ec76a6a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Chip-level CTS</topic><topic>Clock Network</topic><topic>Clocks</topic><topic>Delay</topic><topic>Hardware -- Electronic design automation -- Physical design (EDA)</topic><topic>Merging</topic><topic>Physical Design</topic><topic>Registers</topic><topic>Robustness</topic><topic>System-on-a-chip</topic><topic>Testing</topic><topic>Timing</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Rajaram, Anand</creatorcontrib><creatorcontrib>Pan, David Z.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rajaram, Anand</au><au>Pan, David Z.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Robust chip-level clock tree synthesis for SOC designs</atitle><btitle>2008 45th ACM/IEEE Design Automation Conference</btitle><stitle>DAC</stitle><date>2008-06-08</date><risdate>2008</risdate><spage>720</spage><epage>723</epage><pages>720-723</pages><issn>0738-100X</issn><isbn>1605581151</isbn><isbn>9781605581156</isbn><abstract>A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to different IPs per chip specifications. A primary requirement of CCTS is to balance the sub-clock-trees belonging to different IPs such that the entire tree has a small skew across all process corners. This helps in timing closure across all the design corners. Another important requirement of CCTS is to reduce clock divergence between IPs that have critical timing paths between them, thereby reducing maximum possible clock skew in the critical paths and thus improves yield. In this work, we propose effective CCTS algorithms to simultaneously reduce multi-corner skew and clock divergence. To the best of our knowledge, this is the first work that attempts to solve this practically important problem. Experimental results on several testcases indicate that our methods achieve 10%-31%(20% on average) clock divergence reduction and between 16--64ps skew reduction (1.6%-6.4% of cycle time for a 1GHz clock) with less than 0.5% increase in buffer area/wirelength compared to existing CTS algorithms.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/1391469.1391654</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0738-100X
ispartof 2008 45th ACM/IEEE Design Automation Conference, 2008, p.720-723
issn 0738-100X
language eng
recordid cdi_acm_books_10_1145_1391469_1391654_brief
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Chip-level CTS
Clock Network
Clocks
Delay
Hardware -- Electronic design automation -- Physical design (EDA)
Merging
Physical Design
Registers
Robustness
System-on-a-chip
Testing
Timing
Very large scale integration
title Robust chip-level clock tree synthesis for SOC designs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T09%3A00%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Robust%20chip-level%20clock%20tree%20synthesis%20for%20SOC%20designs&rft.btitle=2008%2045th%20ACM/IEEE%20Design%20Automation%20Conference&rft.au=Rajaram,%20Anand&rft.date=2008-06-08&rft.spage=720&rft.epage=723&rft.pages=720-723&rft.issn=0738-100X&rft.isbn=1605581151&rft.isbn_list=9781605581156&rft_id=info:doi/10.1145/1391469.1391654&rft_dat=%3Cacm_6IE%3Eacm_books_10_1145_1391469_1391654%3C/acm_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4555913&rfr_iscdi=true