On a Pin Versus Block Relationship For Partitions of Logic Graphs

The work

AuthorsB. S. Landman; R. L. Russo
Editors
Typearticle
Year1971
Also known aslandman1971versus
Citekeylandman1971pin

Where it appeared

Published inIEEE Transactions on Computers
PublisherIEEE
VolumeC-20
Issue12
Pages1469--1479

Identifiers

DOI10.1109/t-c.1971.223159
OpenAlexW1970296212

Abstract

Partitions of the set of blocks of a computer logic graph, also called a block graph, into subsets called modules demonstrate that a two-region relationship exists between P, the average number of pins per module, and B, the average number of blocks per module. In the first region, P = KBr, where K is the average number of pins per block and 0.57 ≤ r ≤ 0.75. In the second region, that is, where the number of modules is small (i.e., 1-5), P is less than predicted by the above formula and is given by a more complex relationship. These conclusions resulted from controlled partitioning experiments performed using a computer program to partition four logic graphs varying in size from 500 to 13 000 circuits representing three different computers. The size of a block varied from one NOR circuit in one of the block graphs to a 30-circuit chip in one of the other block graphs.

How it got here

How it got hereagent via openalex
Added2026-08-05 00:00 UTC
Approved bya person 2026-08-07 22:44 UTC

Cite it as

@article{landman1971pin,
  title        = {On a Pin Versus Block Relationship For Partitions of Logic Graphs},
  author       = {B. S. Landman and R. L. Russo},
  year         = {1971},
  journal      = {IEEE Transactions on Computers},
  publisher    = {IEEE},
  volume       = {C-20},
  number       = {12},
  pages        = {1469--1479},
  doi          = {10.1109/t-c.1971.223159},
}

This record lives at https://refs.drheap.org/landman1971pin/ and will keep doing so. It used to be called landman1971versus, and those addresses still resolve to this one.