which routes packets in
Giuseppe Andrea De Biase, C. Ferrone, Annalisa Massini · 1993
A self-routing multi-log N permutation network is presented and studied. This network has log2 N depth and N(log; N+log, N)/2 nodes, where N is the number of network inputs. Its parallel routing algorithm runs in log, N time. The network architecture guarantees that only a negligeable quantity of infomation is blocked, while the quasi-totality of the information synchronously reaches the network outputs in log2 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.