Issue No. 05 - May (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.503772
<p><b>Abstract</b>—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.</p>
Routing algorithm execution, interconnection networks, associative memories, oblivious routing, adaptive routing, and flexible routers.
J. G. Delgado-Frias, S. Vassiliadis and D. H. Summerville, "A Flexible Bit-Pattern Associative Router for Interconnection Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 477-485, 1996.