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.
Paper
Asymptotically Optimal Interconnection Networks from Two-State Cells
Abstract
Some special classes of interconnection networks for n terminals are considered, namely, partitioning networks and full switches. Constructions for them are presented. For the former, the resulting total count of (two-state) cells is n lo g2n + n - log2n - 1, and the maximum delay is 6 log2n - 4. For the latter, the cell count is (n/2) log2n - (n/2) and the maximum delay is 2 log2n - 1. By establishing appropriate lower bounds, we show that these networks are asymptotically optimal as far as cell count is concerned. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.