
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ludek Kucera, "WaitFree Deflection Routing of Long Messages," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 5, pp. 476488, May, 2001.  
BibTex  x  
@article{ 10.1109/71.926169, author = {Ludek Kucera}, title = {WaitFree Deflection Routing of Long Messages}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {5}, issn = {10459219}, year = {2001}, pages = {476488}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.926169}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  WaitFree Deflection Routing of Long Messages IS  5 SN  10459219 SP476 EP488 EPD  476488 A1  Ludek Kucera, PY  2001 KW  Deflection routing KW  fully adaptive routing KW  latency KW  throughput KW  contention. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—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
[1] M. Ajtai, J. Komlós, and E. Szemerédi, “Largest Random Component of a$k$Cube,” Combinatorica, vol. 2, pp. 17, 1982.
[2] “ATM Asynchronous Transfer Mode,” A standard of ITUT (International Telecommunications UnionTelecommunication Sector).
[3] B. Bollobás, Random Graphs. Academic Press, 1995.
[4] A.Z. Broder, A.M. Frieze, and E. Upfal, “Existence and Construction of EdgeDisjoint Paths on Expander Graphs,” SIAM J. Computing, vol. 23, no. 5, pp. 976989, Oct. 1994.
[5] A.Z. Broder, A.M. Frieze, S. Suen, and E. Upfal, “Optimal Construction of EdgeDisjoint Paths in Random Graphs,” Proc. Fifth ACMSIAM Symp. Discrete Algorithms, pp. 603612, 1994.
[6] S.B. Choi and A.K. Somani, "Rearrangeable CircuitSwitched Architectures for Routing Permutations," J. Parallel and Distributed Computing, vol. 19, no. 2, pp. 125130, Oct. 1993.
[7] W.J. Dally and C.L. Seitz, “DeadlockFree Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[8] J. Duato, "A New Theory of DeadlockFree Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,3201,331, Dec. 1993.
[9] P. Erdos and A. Rényi, “On Evolution of Random Graphs,” Publication Math. Inst. of the Hungarian Academy Science, vol. 5, pp. 1761, 1960.
[10] P. Erdos and J. Spencer, “Evolution of the$n$Cube,” Computers and Math. with Applications, vol. 5, pp. 3340, 1979.
[11] “Fibre Channel FCPH,” Am. Nat'l Standard ANSI X3. 230.
[12] P.T. Gaughan and S. Yalamanchili, "A Family of FaultTolerant Routing Protocols for Direct Multiprocessor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, pp. 482487, May 1995.
[13] HiPPI  High Performance Parallel Interface, Mechanical, Electrical, and Signalling Protocol Specification (HIPPIPH), ANSI X3. 1831991.
[14] N. Kahale and T. Leighton, “Greedy Dynamic Routing on Arrays,” Proc. Sixth ACMSIAM Symp. Discrete Algorithms, pp. 558566, 1995.
[15] J.H. Kim, Z. Liu, and A.A. Chien., "Compressionless Routing: A Framework for FaultTolerant Routing," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 3, pp. 229244, Mar. 1997.
[16] A. Karlin, G. Nelson, and H. Tamaki, “On the Fault Tolerance of the Butterfly,” Proc. 26th Ann. ACM Symp. Theory of Computing, pp. 125133, 1994.
[17] P. Kermaniaud and L. Kleinrock, “Virtual Cutthrough: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, pp. 267286, 1979.
[18] H. Kersten, “The Critical Probability of Bond Percolation on the Square Lattice Equals 1/2,” Comm. Math. Physics, vol. 74, pp. 4159, 1980.
[19] S. Konstatinidou and L. Snyder, “Chaos Router,” IEEE Trans. Computers, vol. 43, no. 12, pp. 13861397, Dec. 1994.
[20] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[21] F.T. Leighton, B.M. Maggs, and S.B. Rao, “Packet Routing and JobShop Scheduling in$O(\hbox{congestion}+\hbox{dilation})$Steps,” Combinatorica, vol. 14, pp. 167186, 1994.
[22] A. Lubiw, “Counterexample to a Conjecture of Szymanski on Hypercube Routing,” Information Processing Letters, vol. 35, pp. 5761, 1990.
[23] Mathies, “Percolation Theory and Computing with Faulty Arrays of Processors,” Proc. Third ACMSIAM Symp. Discrete Algorithms, pp. 100103, 1992.
[24] N.F. Maxemchuk, “The Manhattan Street Network,” Proc. IEEE Globecom, pp. 255261, Sept. 1985.
[25] F. Meyer auf der Heide and B. Vöcking, “Routing in Arbitrary Network,” Proc. 12th STACS, 1995.
[26] J. Rolim, P. Tvrdík, J. Trdlicka, and I. Vrto, “Bisecting de Bruijn and Kautz Graphs,” L.M. Kirousis and E. Kranakis, eds., Structure, Information and Comm. Complexity. Proc. Second Colloquium, Carleton Univ. Press, pp. 211222, 1996. Discrete Applied Math., vol. 85, no. 1, pp. 8797, 1998.
[27] A. Schwill, “Shortest EdgeDisjoint Paths in Graphs,” Proc. Sixth Ann. Symp. Theoretical Aspects of Computer Science, pp. 505516, 1989.
[28] “SCI—Scalable Coherent Interface,” IEEE Standard 1596, 1992.
[29] A.P. Sprague and H. Tamaki, “Routing for Involutions of a Hypercube,” Discrete Applied Math., vol. 48, pp. 175186, 1994.
[30] T. Szymanski, “On the Permutation Capability of a CircuitSwitched Hypercube,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 103110, 1989.