Synthesis and exploration of clock spines

Synthesis and exploration of clock spines

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This study addresses the problem of developing a synthesis algorithm for clock spine networks, which is able to systematically explore the clock resources and clock variation tolerance. The idea is to transform the problem of allocating and placing clock spines on a plane into a slicing floorplan optimisation (SFO) problem, in which every candidate of clock spine network structures is uniquely expressed into a postfix notation to enable a fast cost computation in the SFO. As a result, the authors proposed synthesis algorithm can explore the diverse structures of the clock spine network to find globally optimal ones within acceptable run time. Through experiments with benchmark circuits, it is shown that the proposed algorithm is able to synthesise the clock spine networks with 38% reduced clock skew over the clock tree structures, even 11% reduced clock power. In addition, in comparison with the clock mesh structures, the proposed clock spine networks have comparable tolerance to clock skew variation while using considerably less clock resources, reducing clock power by 36%.


    1. 1)
      • 1. Koh, C.-K., Jain, J., Cauley, S.F.: ‘Synthesis of clock and power/ground networks’, in Wang, L.-T., Chang, Y.-W., Cheng, K.-T. (Eds.): ‘Electronic design automation: synthesis, verification, and test’ (Elsevier Inc., 2009, 1st edn.), pp. 751850.
    2. 2)
      • 2. Edahiro, M.: ‘A clustering-based optimization algorithm in zero-skew routings’. ACM/IEEE Design Automation Conf., Dallas, TX, USA, 1993, pp. 612616.
    3. 3)
      • 3. Kim, T.Y., Kim, T.: ‘Clock tree embedding for 3D ICs’. IEEE Asia and South Pacific Design Automation Conf. (ASP-DAC), Taipei, 2010, pp. 486491.
    4. 4)
      • 4. Chao, T.-H., Hsu, Y.-C., Ho, J.-M., et al: ‘Zero skew clock routing with minimum wirelength’, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., 1992, 39, (11), pp. 799814.
    5. 5)
      • 5. Restle, P.J., McNamara, T.G., Webber, D.A., et al: ‘A clock distribution network for microprocessors’, IEEE J. Solid-State Circuits, 2001, 36, (5), pp. 792799.
    6. 6)
      • 6. Kang, M., Kim, T.: ‘Integrated resource allocation and binding in clock mesh synthesis’, ACM Trans. Des. Autom. Electron. Syst., 2014, 19, (3), pp. 30:130:28.
    7. 7)
      • 7. Venkataraman, G., Feng, Z., Hu, J., et al: ‘Combinatorial algorithms for fast clock mesh optimization’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2010, 18, (1), pp. 131141.
    8. 8)
      • 8. Guthaus, M.R., Hu, X., Wilke, G., et al: ‘High performance clock mesh optimization’, ACM Trans. Des. Autom. Electron. Syst., 2012, 17, (3), pp. 33:133:17.
    9. 9)
      • 9. Lu, J., Mao, X., Taskin, B.: ‘Clock mesh synthesis with gated local trees and activity driven register clustering’. IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD), San Jose, CA, USA, 2012, pp. 691697.
    10. 10)
      • 10. Lee, D.J., Markov, I.L.: ‘Multilevel tree fusion for robust clock networks’. IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD), San Jose, CA, USA, 2011, pp. 632639.
    11. 11)
      • 11. Mittal, T., Koh, C.-K.: ‘Cross link insertion for improving tolerance to variations in clock network synthesis’. ACM Int. Symp. on Physical Design, Santa Barbara, CA, USA, 2011, pp. 2936.
    12. 12)
      • 12. Markov, I.L., Lee, D.-J.: ‘Algorithmic tuning of clock trees and derived non-tree structures’. IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD), San Jose, CA, USA, 2011, pp. 279282.
    13. 13)
      • 13. Rajaram, A., Hu, J., Mahapatra, R.: ‘Reducing clock skew variability via crosslinks’, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 2006, 25, (6), pp. 11761182.
    14. 14)
      • 14. Seo, H., Kim, J., Kang, M., et al: ‘Synthesis for power-aware clock spines’. IEEE/ACM Int. Conf. on Computer Aided Design (ICCAD), Austin, TX, USA, 2015, pp. 126131.
    15. 15)
      • 15. Tellez, G.E., Farrahi, A., Sarrafzadeh, M.: ‘Activity-driven clock design for low power circuits’. IEEE Int. Conf. on Computer Aided Design (ICCAD), San Jose, CA, USA, November 1995, pp. 6265.
    16. 16)
      • 16. Shamanna, G., Kurd, N., Douglas, J., et al: ‘A scalable, sub1w, sub-10ps clock skew, global clock distribution architecture for intel coretm i7/i5/i3 microprocessors’. IEEE Symp. on VLSI Circuits, Honolulu, HI, USA, 2010, pp. 8384.
    17. 17)
      • 17. Kim, Y., Kim, T.: ‘Algorithm for synthesis and exploration of clock spines’. IEEE Asia and South Pacific Design Automation Conf., Chiba, Japan, 2017, pp. 263268.
    18. 18)
      • 18. Kirkpatrick, S., Gellat, C.D., Vecchi, M.P.: ‘Optimization by simulated annealing’, Science, 1983, 220, (4598), pp. 671680.
    19. 19)
      • 19. Wong, D.F., Liu, C.L.: ‘A new algorithm for floorplan design’. IEEE/ACM Design Automation Conf., Las Vegas, Nevada, USA, July 1986, pp. 101107.
    20. 20)
      • 20. Gester, M., Hähnle, N., Schneider-Barnes, J.: ‘Largest empty square queries in rectilinear polygons’. Int. Conf. on Computational Science and Its Applications, Banff, AB, Canada, June 2015, pp. 267282.
    21. 21)
      • 21. ‘ISPD 2010 high performance clock network synthesis contest’. Available at, accessed 7 April 2018.
    22. 22)
      • 22. ‘Predictive technology model’. Available at, accessed 7 April 2018.

Related content

This is a required field
Please enter a valid email address