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
DAC 1970
Conference paper
Partitioning of logic graphs: A theoretical analysis of pin reduction
Abstract
Formulae are derived for the number of pins required by the average partition of a computer logic graph. These formulae are used to con-struct curves relating the number of pins re-quired by a group of blocks in a graph with cer-tain statistical properties to the number of blocks in the group. The average effect of the two factors which contribute to pin reduction is discussed.