|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D.H. Linder, J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes," IEEE Transactions on Computers, vol. 40, no. 1, pp. 2-12, January, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/12.67315, author = {D.H. Linder and J.C. Harden}, title = {An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {1}, issn = {0018-9340}, year = {1991}, pages = {2-12}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.67315}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes IS - 1 SN - 0018-9340 SP2 EP12 EPD - 2-12 A1 - D.H. Linder, A1 - J.C. Harden, PY - 1991 KW - adaptive routing; virtual interconnection networks; fault tolerant wormhole routing strategy; k-ary n-cubes; virtual channels; virtual communication systems; adaptability; deadlock-free; channel dependency graph; deadlock-free routing; unidirectional; torus-connected bidirectional; mesh-connected bidirectional; computer architecture; concurrency control; fault tolerant computing. VL - 40 JA - IEEE Transactions on Computers ER - | |||
The concept of virtual channels is extended to multiple virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible, and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free routing are examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional.
[1] W. C. Athas and C. L. Seitz, "Multicomputers," Tech. Rep. 5244:TR:87, Dep. Comput. Sci., California Instit. Technol., 1987.
[2] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[3] I. S. Gopal, "Prevention of store-and-forward deadlock in computer networks,"IEEE Trans. Commun., vol. COM-33, no. 12, pp. 1258-1264, Dec. 1985.
[4] 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.
[5] S. Toueg and J. D. Ullman, "Deadlock-free packet switching networks,"SIAM J. Comput., vol. 10, no. 3, pp. 594-611.
[6] 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.
[7] Submicron Systems Architecture Semiannual Technical Report, Tech. Rep. 5235:TR:86, Dep. Comput. Sci., California Instit. Technol., 1986.
[8] W. D. Hillis, "The connection machine,"Scient. Amer., vol. 256, no. 6, pp. 108-115, June 1987.
[9] W. Welch, "Message-driven solver for Euler fluid dynamics equations," inProc. 1988 ACM Southeast Regional Conf., Apr. 1988.
[10] B. Carre',Graphs and Networks. Oxford, England: Clarendon, 1979, pp. 50-51.
[11] J. Blazewicz, J. Brzezniski, and G. Gambosi, "Time-stamp approach to store-and-forward deadlock prevention,"IEEE Trans. Commun., vol. COM-35, no. 5, pp. 490-495, May 1987.
[12] J. Y. Ngai and C. L. Seitz, "A framework for adaptive routing," Tech. Rep. 5246:TR:87, Dep. Comput. Sci., California Instit. Technol., 1987.
[13] W. J. Dally,A VLSI Architecture for Concurrent Data Structures. Boston, MA: Kluwer Academic, 1987, pp. 144-161.