Abstract
Recent multiprocessors such as Cray T3D support interprocessor communication using partitioned dimension-order routers (PDRs). In a PDR implementation, the routing logic and switching hardware is partitioned into multiple modules, with each module suitable for implementation as a chip. This paper proposes a method to incorporate adaptivity into such routers with simple changes to the router structure and logic. We show that with as few as two virtual channels per physical channel, adaptivity can be provided to handle nonuniform traffic in multidimensional meshes.
Similar content being viewed by others
References
Anajan KV, Pinkston TM. An efficient, fully adaptive deadlock recovery scheme: DISHA. In: Proc. 22nd Ann. Int. Symp. on Comput. Arch. 1995:201–210.
Bolding K, Snyder L. Mesh and torus chaotic routing. In: Proc. of Advanced Research in VLSI and Parallel Systems, 1992.
Boppana RV, Chalasani S. A framework for designing deadlock-free wormhole routing algorithms. IEEE Trans. on Parallel and Distributed Systems 1996;7:169–183.
Boppana RV, Chalasani S. Fault-tolerant communication with partitioned dimension-order routers. IEEE Trans. on Parallel and Distributed Systems 1999;10:1026–1039.
Chien AA. A cost and speed model for $k$-ary $n$-cube wormhole routers. Presented at Hot Interconnects 1993, March 1993.
Cray Research Inc., Cray T3D System Architecture Overview, Sept. 1993.
Dally WJ. Network and processor architecture for message-driven computers. In: Suaya R and Birtwislte, G. eds., VLSI and Parallel Computation chapter 3, San Mateo, California: Morgan-Kaufman Publishers, Inc., 1990, 140–222.
Dally WJ, Seitz CL. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers 1987;C-36(5):547–553.
Dally WJ, Song P. Design of a self-timed VLSI multicomputer communication controller. In: Int’l Conf. on Computer Design, 1987:230–234.
Duato J. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems 1993;4:1320–1331.
Fulgham M, Snyder L. Integrated multi-class routing. In Proc. of Parallel Computer Routing and Communication Workshop, 1997:17–28.
Gaughan PT, Yalamanchili S. A family of fault-tolerant routing protocols for direct multiprocessor networks. IEEE Trans. on Parallel and Distributed Systems 1995;6:482–497.
Glass CJ, Ni LM. The turn model for adaptive routing. In: Proc. 19th Ann. Int. Symp. on Comput. Arch. 1992:278–287.
Intel Corporation, Paragon XP/S Product Overview, 1991.
Kim JH, Chien AA. An evaluation of planar-adaptive routing (PAR). In: Proc. Fourth IEEE Symp. on Par. and Distr. Processing, 1992.
Ngai JY, Seitz CL. A framework for adaptive routing in multicomputer networks. In: Proc. First Symp. on Parallel Algorithms and Architectures 1989:1–9.
Schwiebert L, Jayasimha DN. Optimally fully adaptive routing for meshes. In: Proc. Supercomputing ‘93 1993:782–791.
Seitz CL. Concurrent architectures. In: VLSI and Parallel Computation Suaya R and Birtwistle G eds. chapter. 1, San Mateo, California: Morgan-Kaufman Publishers, Inc., 1990:1–84.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chalasani, S., Boppana, R.V. Adaptive Multimodule Routers for Multiprocessor Architectures. Inf Syst Front 7, 317–327 (2005). https://doi.org/10.1007/s10796-005-2772-5
Issue Date:
DOI: https://doi.org/10.1007/s10796-005-2772-5