Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Packet communication in delta and related networks
Packet communication in delta and related networks
Processor networks and interconnection networks without long wires
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Processor networks and interconnection networks without long wires (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
| Hi-index | 0.00 |
We present a theory that defines performance of packet-switching interconnection networks (delay and capacity) and their cost in terms of their geometry. This is used to prove that square banyan networks have optimal performance/cost ratio. These results, together with some known results on the complexity of routing in multistage networks, show that multistage shuffle-exchange networks are the unique networks with both optimal performance and simple routing. Finally, square delta networks are shown to have optimal area complexity.