|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| G.D. Pifarré, L. Gravano, S.A. Felperin, J.L.C. Sanz, "Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 3, pp. 247-263, March, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/71.277792, author = {G.D. Pifarré and L. Gravano and S.A. Felperin and J.L.C. Sanz}, title = {Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {3}, issn = {1045-9219}, year = {1994}, pages = {247-263}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.277792}, 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 - Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations IS - 3 SN - 1045-9219 SP247 EP263 EPD - 247-263 A1 - G.D. Pifarré, A1 - L. Gravano, A1 - S.A. Felperin, A1 - J.L.C. Sanz, PY - 1994 KW - Index Termsmultiprocessor interconnection networks; concurrency control; parallel machines;message passing; packet switching; adaptive minimal deadlock-free packet routing;hypercubes; meshes; algorithms; simulations; parallel machines; routing algorithms;multiprocessor interconnection networks; shuffle-exchange; two-dimensional mesh;packet routing; virtual cut-through routing models; minimal paths; deadlock VL - 5 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
This paper deals with the problem of packet-switched routing in parallel machines.Several new routing algorithms for different interconnection networks are presented.While the new techniques apply to a wide variety of networks, routing algorithms will beshown for the hypercube, the two-dimensional mesh, and the shuffle-exchange. Althoughthe new techniques are designed for packet routing, they can be used alternatively forvirtual cut-through routing models. The techniques presented for hypercubes and meshesare fully-adaptive and minimal. A fully-adaptive and minimal routing is one in which allpossible minimal paths between a source and a destination are of potential use at thetime a message is injected into the network. Minimal paths followed by messagesultimately depend on the local congestion encountered in each node of the network. Allof the new techniques are completely free of deadlock situations.
[1] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[2] A. G. Ranade, S. N. Bhat, and S. L. Johnson, "The Fluent abstract machine," in J. Allen and F. T. Leighton, Eds.,5th MIT Conf. Advanced Res. in VLSI, 1988, pp. 71-93.
[3] A. Ranade, "How to emulate shared memory," inFoundations of Comput. Sci., 1985, pp. 185-194.
[4] E. Upfal, "AnO(logN) deterministic packet routing scheme," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 241-250.
[5] T. Leighton and B. Maggs, "Expanders might be practical: Fast algorithms for routing around faults on multibutterflies," inProc. 30th Annu. IEEE Symp. Foundations Comput. Sci., 1989, pp. 384-389.
[6] L. Valiant, "General purpose parallel architectures," inHandbook of Theoretical Computer Science, J. van Leeuwen, Ed. Amsterdam: North-Holland, 1988.
[7] S. Konstantinidou and L. Snyder, "The Chaos router: A practical application of randomization in network routing," in2nd Ann. ACM SPAA, 1990, pp. 21-30.
[8] J. Y. Ngai and C. L. Seitz, "A framework for adaptive routing," Tech. Rep. 5246:TR:87, Dep. Comput. Sci., California Instit. Technol., 1987.
[9] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[10] F. Chong, E. Egozy, A. DeHon, and T. Knight, "Multipath fault tolerance in multistage interconnection network," Transit note #48, MIT, June 1991.
[11] S. Borkar et al., "iWarp: An Integrated Solution to High Speed Parallel Computing,"Proc. Supercomputing 88, Vol. 1, CS Press, Los Alamitos, Calif., Order No. 882, pp. 330-339.
[12] D. Lenoski, J. Landon, K. Gharachorloo, W. Weber, A. Goopta, and J. Hennessy, "Overview and status of the Stanford Dash multiprocessor," presented at theInt. Symp. Shared Memory Multiprocessing. Tokyo, Japan, Apr. 1991.
[13] C. Kruskal and M. Snir, "The performance of multistage interconnection networks for multiprocessors,"IEEE Trans. Comput., vol. C-32, pp. 1091-1098, Dec. 1983.
[14] S. A. Felperin, L. Gravano, G. D. Pifarré, and J. L. C. Sanz, "Routing techniques for massively parallel communication,"Proc. IEEE(special issue on massively parallel computers), vol. 79, pp. 488-503, Apr. 1991.
[15] M. Fulgham, R. Cypher and J. Sam, "A comparison of SIMD hypercube routing strategies," RJ 7722 (71587), IBM Almaden Res. Ctr., 1990. (Also presented at theProc. ICPP '91, Int. Conf. Parallel Processing, 1991.)
[16] L. Ni and P. McKinley, "A survey of routing techniques in wormhole networks," MSU-CPS-ACS-46, Dep. of Comput. Sci., Michigan State Univ., Oct. 1991.
[17] P. Kermani and L. Kleinrock, "Virtual Cut-Through: A new computer communication switching technique,"Comput. Networks, no. 3, pp. 267-286, 1979.
[18] N. Pippenger, "Parallel communication with limited buffers," inFoundations of Comput. Sci., pp. 127-136, 1984.
[19] T. Leighton, B. Maggs, and S. Rao, "Universal packet routing algorithms," 1988.
[20] D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,"IEEE Trans. Comput., vol. C-30, pp. 709-715, Oct. 1981.
[21] S. Konstantinidou, "Adaptive, minimal routing in hypercubes," in6th MIT Conf. Advanced Res. VLSI, 1990, pp. 139-153.
[22] Y. Birk, P. Gibbons, D. Soroker and J. Sanz, "A simple mechanism for efficient barrier synchronization in MIMD machines," RJ 7078 (67141) Comput. Sci., IBM Almaden Res. Ctr., Oct. 1989.
[23] K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512-524, Apr. 1981.
[24] P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in store-and-forward networks--I: Store-and-forward deadlock,"IEEE Trans. Commun., vol. COM-28, pp. 345-354, Mar. 1980.
[25] W. Dally and H. Aoki, "Adaptive Routing using Virtual Channels," tech. rep., MIT, 1990.
[26] T. Leighton, "Average case analysis of greedy routing algorithms on arrays," inSPAA, 1990.
[27] P. Raghavan and E. Upfal, "A theory of wormhole routing in parallel computers," RJ:8512 (76733), IBM Res., Dec. 1991.
[28] G. D. Pifarré, L. Gravano, S. A. Felperin, and J. L.C. Sanz, "Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks," inProc. 3rd Ann. ACM Symp Parallel Algorithms and Architectures, 1991.
[29] R. Cypher and L. Gravano, "Adaptive deadlock-free packet routing in torus-networks with minimal storage," RJ:8571 (77350), IBM Almaden Res. Ctr., Jan. 1992. (Also presented at theICPP'92.)
[30] B. Cypher and D. Gavano, "Requirements for deadlock-free, adaptive packet routing, " inProc. 11th ACM Symp. Principles of Distrib. Computing, 1992, pp. 25-33.
[31] K. Bolding and L. Snyder, "Mesh and torus chaotic routing," UW CS91-04-04, Univ. of Washington, 1991. Also presented at theMIT/Brown Advanced Res. in VLSI and Parallel Syst. Conf., Mar. 1992.
[32] W. J. Dally, "Virtual-channel flow control," inProc. 17th Annu. Int. Symp. Comput. Architecture, May 1990.
[33] D. Linder and J. Harden, "An adaptive and fault tolerant wormhole routing strategy fork-aryn-cubes,"IEEE Trans. Comput., vol. 40, pp. 2-12, Jan. 1991.
[34] S. A. Felperin, L. Gravano, G. D. Pifarré, and J. L. C. Sanz, "Fully-adaptive routing: Packet switching performance and wormhole algorithms," inSupercomputing, pp. 654-663, 1991.
[35] L. Gravano, G. Pifarré, S. Felperin, and J. Sanz, "Adaptive deadlock-free worm-hole routing with all minimal paths," TR: 91-21, IBM Argentina, CRAAG, Aug. 1991.
[36] P. Berman, L. Gravano, G.D. Pifarré, and J. L. C. Sanz, "Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks," inProc. 4th Symp. Parallel Algorithms and Architectures (SPAA), 1992.
[37] A. G. Greenberg and B. Hajek, "Deflection routing in hypercube networks,"IEEE Trans. Commun., vol. 40, pp. 1070-1081, 1992.
[38] B. Hajek, "Bounds on evacuation time for deflection routing,"Distributed Computing, vol. 5, pp. 1-6, 1991.
[39] S. Felperin, H. Laffitte, G. Buranits, and J. Sanz, "Deadlock-free minimal packet routing in the torus network," TR: 91-22, IBM Argentina, CRAAG, 1991.
[40] G. Pifarré, L. Gravano, S. Felperin, and J. Sanz, "Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks," Tech. Rep., IBM Argentina, CRAAG, 1991.
[41] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.
[42] L. Valiant, "Optimality of a two-phase strategy for routing in interconnection networks," Mar. 1982.
[43] E. Upfal, "Efficient schemes for parallel communication,"J. ACM, vol. 31, no. 3, July 1984.
[44] J. Lim,Two-Dimensional Signal and Image Processing. Englewood Cliffs, NJ: Prentice-Hall, 1990.
[45] S.Konstantinidou and E. Upfal, "Experimental comparison of multistage interconnection networks," RJ:8451 (76459). IBM Almaden Res. Ctr., Nov. 1991.
[46] R. Cypher and C. G. Plaxton, "Deterministic sorting in nearly logarithmic time on the hypercube and related computers," inProc. 22nd ACM Symp. Theory Comput., 1990, pp. 193-203.
[47] D. Nassimi and S. Sahni, "Parallel permutation and sorting algorithms and a new generalized connection network,"J. ACM, vol. 29, no. 3, pp. 642-667, 1982.
[48] J. Patel, "Performance of processor-memory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C-30, pp. 771-780, Oct. 1981.
[49] D. Dias and J. Jump, "Analysis and simulations of buffered delta networks,"IEEE Trans. Comput., vol. C-30, pp. 273-282, Apr. 1981.
[50] G. Pfister and V. Norton, "'Hot Spot' contention and combining in multistage interconnection networks,"IEEE Trans. Comput., vol. C-34, pp. 943-948, Oct. 1985.
[51] J. Ngai and C. Seitz, "Adaptive routing in multicomputers," inOpportunities and Constraints of Parallel Computing, J. Sanz, Ed. New York: Springer Verlag, 1989.