Abstract
Communication in parallel computers requires a low latency router. Once a suitable routing algorithm is selected, an implementation must be designed. Issues such as whether the router should be input or output driven need to be considered. In this paper, we use simulations to compare input driven and output driven routing algorithms. Three algorithms, the Dally-Seitz oblivious router, the *-channels router, and the minimal triplex algorithm are evaluated. Each router is implemented as both an input and an output driven router. Experiments are run for each of the router implementations with seven different traffic patterns on both a 256-node two dimensional mesh and torus networks. The results show that in almost all cases, the output driven router matches or outperforms the input driven router. Furthermore, we find that randomization of output buffer selection in the input driven algorithm increases its performance and substantially reduces the performance discrepancy between the input and output driven algorithms. Although the findings apply to the routers considered, we believe the results generalize to other routers.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported in part by the National Science Foundation Grant MIP-9213469 and by an ARPA Graduate Research Fellowship.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
P. Berman, L. Gravano, G. Pifarré, and J. Sanz. Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks. In Proc. of SPAA, 1992.
M. Blumrich, K. Li, R. Alpert, C. Dubnicki, and E. Felten. Virtual memory mapped network interface for the SHRIMP multicomputer. In Proc. of ISCA, pages 142–153, 1994.
K. Bolding. Chaotic Routing: Design and Implementation of an Adaptive Multicomputer Network Router. PhD thesis, University of Washington, Seattle, July 1993.
K. Bolding, M. Fulgham, and L. Snyder. The case for chaotic adaptive routing. IEEE Transactions on Computers, to appear.
L. Cherkasova and T. Rokicki. Alpha message scheduling for packet-switched interconnects. Technical Report TR HPL-94-72, Hewlett-Packard Labs, 1994.
A. Chien and J. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proc. of the Intl. Sym. on Computer Architecture, pages 268–277, 1992.
W. Dally. Virtual-channel flow control. In Proc. of the Intl. Sym. on Comp. Arch., May 1990.
W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–553, May 1987.
J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 4(4):466–475, Apr. 1993.
M. Fulgham and L. Snyder. A comparison of input and output driven routers. Technical Report UW-CSE-96-06-01, Univ. of Washington, Seattle, 1996.
M. Fulgham and L. Snyder. Triplex router: a versatile torus routing algorithm. Technical Report UW-CSE-96-01-11, Univ. of Washington, Seattle, 1996.
C. Glass and L. Ni. Adaptive routing in mesh-connected networks. In Proc. of the Intl. Conf. on Distributed Computing Systems, pages 12–19, 1992.
C. J. Glass and L. M. Ni. The turn model for adaptive routing. JACM, 41(5):874–902, 1994.
P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267–286, 1979.
S. Konstantinidou. The segment router: a novel router design for parallel computers. In Proc. of the Sym. of Parallel Algorithms and Architectures, pages 364–373, 1994.
S. Konstantinidou and L. Snyder. The chaos router. IEEE Transactions on Computers, 43(12):1386–97, Dec. 1994.
D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, C-40(1):2–12, Jan. 1991.
N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder. CRANIUM: An interface for message passing on adaptive packet routing networks. In Lecture Notes in Computer Science, volume 853, pages 266–80, 1994.
L. Schwiebert and D. Jayasimha. A universal proof technique for deadlock-free routing in interconnection networks. In Proc. of the Sym. on Par. Alg. and Arch., pages 175–184, 1995.
T. von Eicken D.E. Culler, S. Goldstein, and K. Schauser. Active messages: a mechanism for integrated communication and computation. In Proc. of ISCA, pages 256–266, May 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fulgham, M.L., Snyder, L. (1996). A comparison of input and output driven routers. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive