Issue No. 05 - May (2001 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.926169
<p><b>Abstract</b>—In order to obtain the lowest possible latency, routing algorithms should try to avoid a message waiting for resources (network links) blocked by other messages or multiplexing of more messages over one physical channel. This requirement becomes especially important in the case of long messages. The only type of protocols able to guarantee waiting free routing under heavy load are algorithms based on deflection (also called nonminimal adaptive or hot potato) routing. This paper deals with problems connected with the use of deflection algorithms. In contrast to the case of nonadaptive or partially (e.g., minimal) adaptive routing, it is very infrequent that an unrestricted deflection routing becomes deadlocked and, similarly, livelock is not a serious problem. On the other hand, there is another phenomenon, called a <it>deflection jam</it>, that limits throughput of deflection algorithms used to route long messages. It has been observed for many deflection heuristics, interconnection network topologies, and both virtual cut-through and wormhole routing. A deflection jam is a sudden and persistent saturation of a network which sometimes occur, after a very long period of undisturbed communication. This paper describes events that trigger this saturation which suggest ways to design improved and stable deflection routing algorithms.</p>
Deflection routing, fully adaptive routing, latency, throughput, contention.
Ludek Kucera, "Wait-Free Deflection Routing of Long Messages", IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 476-488, May 2001, doi:10.1109/71.926169