Parallel clock tree synthesis

Parallel clock tree synthesis

Clock tree synthesis (CTS) is an important phase of the physical design of integrated circuits in which the network carrying the clock signal is laid out. As the sizes of modern circuits continue to grow exponentially, the amount of computation required in designing the clock network increases propo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rakai, L., Behjat, L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Clocks
Design automation
Parallel algorithms
Partitioning algorithms
Synchronization
Topology
Vegetation
Wires
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4
container_issue
container_start_page 1
container_title
container_volume
creator Rakai, L.
Behjat, L.
description Clock tree synthesis (CTS) is an important phase of the physical design of integrated circuits in which the network carrying the clock signal is laid out. As the sizes of modern circuits continue to grow exponentially, the amount of computation required in designing the clock network increases proportionally. CTS is a prime candidate for parallelization but is almost entirely unexplored in the literature. This paper highlights properties of common algorithms for performing CTS that are favorable for parallelization and presents parallel versions of the algorithms. Practical considerations in implementing parallel versions of the algorithms are also discussed. Experiments show the effectiveness of the parallel implementations in achieving linear speedup with the number of processors.
doi_str_mv 10.1109/CCECE.2012.6334906
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6334906</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6334906</ieee_id><sourcerecordid>6334906</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-c2e4f77862a176e0fb220e625c1edc92e9fd6b7065b31727d64e38aaaf2450d13</originalsourceid><addsrcrecordid>eNo1j8tKxEAQAMcXmF33BxRhfyCxu2emO3OUEB-woAc9L5Okg9H4IJPL_r3Crqc6FBSUMZcIBSKEm6qqq7ogQCrYWheAj8wqSImOxaKzFI5NRl44F3B8Yhb_Av2pyaB0kIuU4dwsUnoHAFeyy8z1c5ziOOq4bsfv9mM9T6rrtPua3zQN6cKc9XFMujpwaV7v6pfqId883T9Wt5t8QPFz3pK6_i_OFFFYoW-IQJl8i9q1gTT0HTcC7BuLQtKxU1vGGHtyHjq0S3O17w6quv2Zhs847baHTfsL_B9AoQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Parallel clock tree synthesis</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Rakai, L. ; Behjat, L.</creator><creatorcontrib>Rakai, L. ; Behjat, L.</creatorcontrib><description>Clock tree synthesis (CTS) is an important phase of the physical design of integrated circuits in which the network carrying the clock signal is laid out. As the sizes of modern circuits continue to grow exponentially, the amount of computation required in designing the clock network increases proportionally. CTS is a prime candidate for parallelization but is almost entirely unexplored in the literature. This paper highlights properties of common algorithms for performing CTS that are favorable for parallelization and presents parallel versions of the algorithms. Practical considerations in implementing parallel versions of the algorithms are also discussed. Experiments show the effectiveness of the parallel implementations in achieving linear speedup with the number of processors.</description><identifier>ISSN: 0840-7789</identifier><identifier>ISBN: 1467314315</identifier><identifier>ISBN: 9781467314312</identifier><identifier>EISSN: 2576-7046</identifier><identifier>EISBN: 9781467314329</identifier><identifier>EISBN: 1467314331</identifier><identifier>EISBN: 9781467314336</identifier><identifier>EISBN: 1467314323</identifier><identifier>DOI: 10.1109/CCECE.2012.6334906</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Clocks ; Design automation ; Parallel algorithms ; Partitioning algorithms ; Synchronization ; Topology ; Vegetation ; Wires</subject><ispartof>2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), 2012, p.1-4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6334906$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6334906$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rakai, L.</creatorcontrib><creatorcontrib>Behjat, L.</creatorcontrib><title>Parallel clock tree synthesis</title><title>2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)</title><addtitle>CCECE</addtitle><description>Clock tree synthesis (CTS) is an important phase of the physical design of integrated circuits in which the network carrying the clock signal is laid out. As the sizes of modern circuits continue to grow exponentially, the amount of computation required in designing the clock network increases proportionally. CTS is a prime candidate for parallelization but is almost entirely unexplored in the literature. This paper highlights properties of common algorithms for performing CTS that are favorable for parallelization and presents parallel versions of the algorithms. Practical considerations in implementing parallel versions of the algorithms are also discussed. Experiments show the effectiveness of the parallel implementations in achieving linear speedup with the number of processors.</description><subject>Algorithm design and analysis</subject><subject>Clocks</subject><subject>Design automation</subject><subject>Parallel algorithms</subject><subject>Partitioning algorithms</subject><subject>Synchronization</subject><subject>Topology</subject><subject>Vegetation</subject><subject>Wires</subject><issn>0840-7789</issn><issn>2576-7046</issn><isbn>1467314315</isbn><isbn>9781467314312</isbn><isbn>9781467314329</isbn><isbn>1467314331</isbn><isbn>9781467314336</isbn><isbn>1467314323</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j8tKxEAQAMcXmF33BxRhfyCxu2emO3OUEB-woAc9L5Okg9H4IJPL_r3Crqc6FBSUMZcIBSKEm6qqq7ogQCrYWheAj8wqSImOxaKzFI5NRl44F3B8Yhb_Av2pyaB0kIuU4dwsUnoHAFeyy8z1c5ziOOq4bsfv9mM9T6rrtPua3zQN6cKc9XFMujpwaV7v6pfqId883T9Wt5t8QPFz3pK6_i_OFFFYoW-IQJl8i9q1gTT0HTcC7BuLQtKxU1vGGHtyHjq0S3O17w6quv2Zhs847baHTfsL_B9AoQ</recordid><startdate>201204</startdate><enddate>201204</enddate><creator>Rakai, L.</creator><creator>Behjat, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201204</creationdate><title>Parallel clock tree synthesis</title><author>Rakai, L. ; Behjat, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-c2e4f77862a176e0fb220e625c1edc92e9fd6b7065b31727d64e38aaaf2450d13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Clocks</topic><topic>Design automation</topic><topic>Parallel algorithms</topic><topic>Partitioning algorithms</topic><topic>Synchronization</topic><topic>Topology</topic><topic>Vegetation</topic><topic>Wires</topic><toplevel>online_resources</toplevel><creatorcontrib>Rakai, L.</creatorcontrib><creatorcontrib>Behjat, L.</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>Rakai, L.</au><au>Behjat, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Parallel clock tree synthesis</atitle><btitle>2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)</btitle><stitle>CCECE</stitle><date>2012-04</date><risdate>2012</risdate><spage>1</spage><epage>4</epage><pages>1-4</pages><issn>0840-7789</issn><eissn>2576-7046</eissn><isbn>1467314315</isbn><isbn>9781467314312</isbn><eisbn>9781467314329</eisbn><eisbn>1467314331</eisbn><eisbn>9781467314336</eisbn><eisbn>1467314323</eisbn><abstract>Clock tree synthesis (CTS) is an important phase of the physical design of integrated circuits in which the network carrying the clock signal is laid out. As the sizes of modern circuits continue to grow exponentially, the amount of computation required in designing the clock network increases proportionally. CTS is a prime candidate for parallelization but is almost entirely unexplored in the literature. This paper highlights properties of common algorithms for performing CTS that are favorable for parallelization and presents parallel versions of the algorithms. Practical considerations in implementing parallel versions of the algorithms are also discussed. Experiments show the effectiveness of the parallel implementations in achieving linear speedup with the number of processors.</abstract><pub>IEEE</pub><doi>10.1109/CCECE.2012.6334906</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0840-7789
ispartof 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), 2012, p.1-4
issn 0840-7789
2576-7046
language eng
recordid cdi_ieee_primary_6334906
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Clocks
Design automation
Parallel algorithms
Partitioning algorithms
Synchronization
Topology
Vegetation
Wires
title Parallel clock tree synthesis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T17%3A10%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Parallel%20clock%20tree%20synthesis&rft.btitle=2012%2025th%20IEEE%20Canadian%20Conference%20on%20Electrical%20and%20Computer%20Engineering%20(CCECE)&rft.au=Rakai,%20L.&rft.date=2012-04&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.issn=0840-7789&rft.eissn=2576-7046&rft.isbn=1467314315&rft.isbn_list=9781467314312&rft_id=info:doi/10.1109/CCECE.2012.6334906&rft_dat=%3Cieee_6IE%3E6334906%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467314329&rft.eisbn_list=1467314331&rft.eisbn_list=9781467314336&rft.eisbn_list=1467314323&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6334906&rfr_iscdi=true