Measurements for structural logic synthesis optimizations

Routability or wiring congestion in a very large scale integration chip is becoming increasingly important as chip complexity increases. Congestion has a significant impact on performance, yield, and chip area. Although advances in placement algorithms have attempted to alleviate this problem, the inherent structure of the logic netlist has a significant impact on the routability irrespective of the placement algorithm used. Placement algorithms find optimal assignments of locations to the logic and do not have the ability to change the netlist structure. Significant decisions regarding the circuit structure are made early in synthesis during the technology-independent logic-optimization step. Optimizations in this step use literal count as a metric for optimization and do not adequately capture the intrinsic entanglement of the netlist. Two circuits with identical literal counts may have significantly different congestion characteristics after placement. In this paper, we postulate that a property of the network structure called adhesion can make a significant contribution to routing congestion. We then provide a metric to measure this property. We evaluate the utility of adhesion as measured by this metric to estimate and optimize postrouting congestion early in the design flow. A heuristic for measuring adhesion is evaluated as well.

[1]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[2]  Christos D. Zaroliagis,et al.  All-Pairs Min-Cut in Sparse Networks , 1995, FSTTCS.

[3]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[4]  Andrew V. Goldberg,et al.  Cut tree algorithms , 1999, SODA '99.

[5]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[6]  F. Harary,et al.  The cohesiveness of blocks in social networks: Node connectivity and conditional density , 2001 .

[7]  W. Donath.  Equivalence of memory to Random Logic , 1974 .

[8]  Daniel Brand,et al.  BooleDozer: Logic synthesis for ASICs , 1996, IBM J. Res. Dev..

[9]  Thomas W. Reps,et al.  An incremental algorithm for maintaining the dominator tree of a reducible flowgraph , 1994, POPL '94.

[10]  Davide Pandini,et al.  Congestion-aware logic synthesis , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[11]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[12]  Jan M. Rabaey,et al.  Limitations and challenges of computer-aided design technology for CMOS VLSI , 2001, Proc. IEEE.

[13]  Elena Dubrova,et al.  Circuit-Based Evaluation of the Arithmetic Transform of Boolean Functions , 2002, IWLS.

[14]  Massoud Pedram,et al.  Layout driven logic restructuring/decomposition , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[15]  Zvi Galil,et al.  Fully dynamic planarity testing with applications , 1999, JACM.

[16]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[17]  Petra Mutzel,et al.  An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm , 1993 .

[18]  Majid Sarrafzadeh,et al.  Congestion reduction during placement based on integer programming , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[19]  D. R. White,et al.  Social Cohesion and Embeddedness : A Hierarchical Conception of Social Groups , 2000 .

[20]  D. R. White,et al.  Structural cohesion and embeddedness: A hierarchical concept of social groups , 2003 .

[21]  Dennis J.-H. Huang,et al.  Multilevel Circuit Partitioning , 1997, Proceedings of the 34th Design Automation Conference.

[22]  Annegret Liebers,et al.  Journal of Graph Algorithms and Applications Planarizing Graphs — a Survey and Annotated Bibliography , 2022 .

[23]  M. Newman,et al.  Fast Approximation Algorithms for Finding Node-Independent Paths in Networks , 2001 .

[24]  Janusz Rajski,et al.  A method for concurrent decomposition and factorization of Boolean expressions , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[25]  Robert K. Brayton,et al.  Regular Fabrics in Deep Sub-Micron Integrated-Circuit Design , 2004, IWLS.

[26]  Thomas Kutzschebauch,et al.  Regularity driven logic synthesis , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[27]  Wojciech Maly,et al.  Interconnect yield model for manufacturability prediction in synthesis of standard cell based designs , 1996, ICCAD 1996.

[28]  Chung-Kuan Cheng,et al.  Fast post-placement rewiring using easily detectable functional symmetries , 2000, Proceedings 37th Design Automation Conference.