DocumentCode :
1867624
Title :
Parallel clock tree synthesis
Author :
Rakai, Logan ; Behjat, Laleh
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Calgary, Calgary, AB, Canada
fYear :
2012
fDate :
April 29 2012-May 2 2012
Firstpage :
1
Lastpage :
4
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.
Keywords :
clocks; integrated circuit design; parallel algorithms; clock network; clock signal; integrated circuits; parallel clock tree synthesis; parallelization; physical design; Algorithm design and analysis; Clocks; Partitioning algorithms; Synchronization; Topology; Vegetation; Wires; Design automation; Parallel algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical & Computer Engineering (CCECE), 2012 25th IEEE Canadian Conference on
Conference_Location :
Montreal, QC
ISSN :
0840-7789
Print_ISBN :
978-1-4673-1431-2
Electronic_ISBN :
0840-7789
Type :
conf
DOI :
10.1109/CCECE.2012.6334906
Filename :
6334906
Link To Document :
بازگشت