About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICCAD 1985
Conference paper
TRIVIAL GLOBAL WIRING OF LARGE CHIPS: A STATISTICAL ANALYSIS.
Abstract
A two-dimensional stochastic model of the global wiring of a VLSI chip or macro is defined; prominent in the definition is the property that the probability of connecting two pins is solely a function of the distance between the cells containing them. Given a global wiring, row and column widths (and macro size) are defined by the widest cells in each row and column. A lower bound is placed on the expected size of the macro with perfect wiring. An upper bound is placed on the expected size of the macro with a trival (all 'L's) wiring scheme. From these bounds it is shown that the fraction difference between the trivial and perfect wirings approaches zero as the log of the number of columns divided by the square root of the average row size.