Abstract
Networks of workstations (NOWs) are becoming an increasingly popular alternative to parallel computers for those applications with high needs of resources such as memory capacity and input/output storage space, and also for small scale parallel computing. Although the mean time between failures (MTBF) for individual links and switches in a NOW isvery high, the probability of a failure occurrence dramatically increases as the network size becomes larger. Moreover, there are external factors, such as accidental link disconnections, that also can aÿect the overall NOW reliability. Until the faulty element is replaced, the NOW is functioning in a degraded mode. Thus, it becomes necessary to quantify how much the global NOW performance is reduced during the time the system remains in this state. In this paper we analyze the performance degradation of networks of workstations when failures in links or switches occur. Because the routing algorithm is a key issue in the design of a NOW, we quantify the sensitivity to failures of two routing algorithms: up*/down* and minimal adaptive routing algorithms. Simulation results show that, in general, up*/down* routing is highly robust to failures. On the other hand, the minimal adaptive routing algorithm presents a better performance, even in the presence of failures, but at the expense of a larger sensitivity.
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
N. J. Boden, et al., “Myrinet — A gigabit per second local area network,” in IEEE Micro, pp. 29–36, February 1995. 230, 231
R. V. Boppana and S. Chalasani, “Fault-tolerant wormhole routing algorithms for mesh networks,” in IEEE Trans. on Computers, vol. 44, no. 7, pp 848–864, July 1995. 231
R. Casado, et al., “Performance evaluation of Dynamic reconfiguration in highspeed local area networks,” in Proc. of 6th Int. Symp. on High-Perf. Comp. Arch., 2000. 231
W. J. Dally and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels”, IEEE TPDS, vol. 4, no.4, pp. 466–477, April 1993.
J. Duato, S. Yalamanchili, L. Ni. Interconnection Networks. An Engineering Approach. IEEE Computer Society. 1997.
D. Garcia and W. Watson. “ServerNet II”, in Proc. of the 1997 Parallel Computing, Routing and Communication Workshop. June, 1997. 230
P. T. Gaughan and S. Yalamanchili, “A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks”, IEEE Trans. on Parallel and Distributed Systems, vol. 6, no. 5, pp. 482–497, May 1995. 231
X. Molero et al., “Modeling and simulation of a network of workstations with wormhole switching”, in Proc. of the 33rd Annual Simulation Symposium, April 2000. 237
W. Qiao and L. M. Ni, “Adaptive routing in irregular networks using cut-through switches,” in Proc. of the 1996 Int. Conf. on Parallel Processing, August 1996. 232
M. D. Schroeder et al., “Autonet: A high-speed, self-configuring local area network using point-to-point links,” Technical Report SRC 59, DEC, April 1990. 230, 231, 232, 233
F. Silla and J. Duato, “Improving the efficiency of adaptive routing in networks with irregular topology,” in Proc. of the 1997 Int. Conf. on High Perf. Comp., 1997. 231, 232, 233, 235
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Molero, X., Silla, F., Santonja, V., Duato, J. (2000). Performance Sensitivity of Routing Algorithms to Failures in Networks of Workstations. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-39999-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41128-4
Online ISBN: 978-3-540-39999-5
eBook Packages: Springer Book Archive