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.