A quasi-nonblocking self-routing network which routes packets in log/sub 2/N time
Giuseppe Andrea De Biase, C. Ferrone, Annalisa Massini · 2002
A self-routing multi-log-N permutation network is presented and studied. This network has log/sub 2/N depth and N(log/sub 2//sup 2/N+log/sub 2/N)/2 nodes, where N is the number of network inputs. Its parallel routing algorithm runs in log/sub 2/N time. The network architecture guarantees that only a negligible quantity of information is blocked, while the quasi-totality of the information synchronously reaches the network outputs in log/sub 2/N steps. This network works in pipeline, it has a modular architecture suitable for very large N, it can be used as very high performance fast packet switching fabric, and it is suitable for information exchange in very-large-scale multiprocessor systems.>