Finding broad-scale patterns in large size electronic circuit netlists

Integrated circuit structure has advanced to extremely large complexity, such as 108 or more components per chip. Design and circuit optimization becomes quite difficult for these IC sizes. This paper presents a methodology that helps to understand the circuit topologies before the physical realization of the system. This paper explains that large size electronic circuit netlists have broad-scale patterns and large clustering coefficients. These attributes are very different from random graphs, usually assumed for representing circuit netlists. Furthermore, the paper introduces a model to explain the large clustering coefficient of electronic circuit netlists

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  R. F. Cancho,et al.  Topology of technology graphs: small world patterns in electronic circuits. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[4]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[5]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[6]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[7]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[8]  D. West.  Introduction to Graph Theory , 1995 .

[9]  Hawoong Jeong,et al.  Classification of scale-free networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  A. P. Simonds.  When ideas become tollbooths , 1999, Nature.

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[15]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.