1 July 1992 Paradigms of connectivity for computer circuits and networks
Author Affiliations +
Optical Engineering, 31(7), (1992). doi:10.1117/12.57685
Abstract
We discuss several concepts of connectivity for circuit graphs, including Rent's rule, line length distributions, and separators, all of which we argue are fractal concepts. We provide generalizations for systems for which the Rent exponent is not constant throughout the interconnection hierarchy.
Haldun M. Ozaktas, "Paradigms of connectivity for computer circuits and networks," Optical Engineering 31(7), (1 July 1992). http://dx.doi.org/10.1117/12.57685
JOURNAL ARTICLE
5 PAGES


SHARE
KEYWORDS
Fractal analysis

Computer networks

Computing systems

Brain

Mathematical modeling

Microelectronics

Optical interconnects

Back to Top