Abstract
Networks of workstations (NOWs) are becoming a cost-effective alternative for small-scale parallel computing. Usually, NOWs present an irregular topology as a consequence of the needs in a local area network. Routing algorithms used in NOWs are inherently different from those used in regular networks, mainly due to the irregular connections between switches. In these algorithms, routing is considerably restricted in order to avoid deadlocks. Recently, a general methodology for the design of adaptive routing algorithms for irregular networks has been proposed by the authors. The resulting algorithms increase the maximum achievable throughput while reducing message latency. In this paper, we study how much network performance we are losing due to the irregular topology of NOWs. We analyze the performance of the up*/down* routing algorithm in a 2D mesh topology and compare it with the performance achieved by the XY routing scheme in the same network, in order to answer the following two questions: 1) in a 2D mesh, which of the two routing algorithms achieves better performance?, and 2) where does the up*/down* routing algorithm work better, in a 2D mesh or in an irregular network?. Simulation results show that the up*/down* routing strategy performs better in a regular network than in an irregular one. On the other hand, the XY routing algorithm considerably outperforms the up*/down* scheme. However, when the adaptive routing algorithm proposed by the authors is used, differences in performance are much smaller. Thus, the higher performance of a regular topology could not compensate for the loss in wiring flexibility with respect to irregular networks, or their capability of adding a single switch at any moment.
This work was supported by the Spanish CICYT under Grant TIC97-0897-C04-01
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boden, N.J., Cohen, D., Felderman, R.E., Kulawik, A.E., Seitz, C.L., Seizovic, J., Su, W.: Myrinet - A gigabit per second local area network. IEEE Micro, 29–36 ( February 1995)
Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers C-36(5), 547–553 (1987)
Duato, J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems 4(12), 1320–1331 (1993)
Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. IEEE Computer Society Press, Los Alamitos (1997)
Garcia, D.: Servernet II. In: 1997 Parallel Computer Routing and Communication Workshop (June 1997)
Qiao, W., Ni, L.M.: Adaptive routing in irregular networks using cut-through switches. In: Proceedings of the 1996 International Conference on Parallel Processing (August 1996)
Schroeder, M.D., et al.: Autonet: A high-speed, self-configuring local area network using point-to-point links, Technical Report SRC research report 59, DEC (April 1990)
Silla, F., Duato, J.: Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology. In: 1997 Int. Conference on High Performance Computing (December 1997)
Silla, F., Duato, J.: On the Use of Virtual Channels in Networks of Workstations with Irregular Topology. In: 1997 Parallel Computer Routing and Comm. Workshop (June 1997)
Silla, F., et al.: Efficient Adaptive Routing in Networks of Workstations with Irregular Topology. In: Workshop on Communications and Architectural Support for Network-based Parallel Computing (February 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silla, F., Duato, J. (1999). Is It Worth the Flexibility Provided by Irregular Topologies in Networks of Workstations?. In: Sivasubramaniam, A., Lauria, M. (eds) Network-Based Parallel Computing. Communication, Architecture, and Applications. CANPC 1999. Lecture Notes in Computer Science, vol 1602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704826_4
Download citation
DOI: https://doi.org/10.1007/10704826_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65915-0
Online ISBN: 978-3-540-48869-9
eBook Packages: Springer Book Archive