IEEE Transactions on Parallel and Distributed Systems · 1996 · 22 citations · 8 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksInterconnection NetworksInterconnect ArchitectureNetwork ArchitectureNetwork TopologyRoutingRouting AlgorithmsRouting ArchitectureInterconnect Network DesignInterconnection Network RoutingInterconnection Network Topology DesignInterconnection Pattern MappingProgrammable Interconnect ArchitectureTopology-aware Routing
A programmable associative approach to execute implicit routing algorithms is presented. Algorithms are mapped onto a set of bit-patterns that are matched in parallel. We have studied and mapped a large number of routing algorithms for a wide range of interconnection network topologies. Here we report three cases that illustrate the capabilities of the router scheme. For the studied topologies, the number of required bit-patterns is of the same order as the topology degree. The proposed approach is one of the fastest routers and requires a very small amount of hardware.
8
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text
The turn model for adaptive routing
Christopher J. Glass, Lionel M. Ni · Journal of the ACM · 1994 · 402 citations · Full text
Jan Van Leeuwen · The Computer Journal · 1987 · 213 citations · Full text