Abstract
Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are arranged as a switch-based network with irregular topology, which makes routing and deadlock avoidance quite complicated. Current proposals use the up*/down* routing algorithm to remove cyclic dependencies between channels and avoid deadlock. However, routing is considerably restricted and most messages must follow non-minimal paths, increasing latency and wasting resources. In this paper, we propose a new methodology to compute deadlock-free routing tables for NOWs. The methodology tries to minimize the limitations of the current proposals in order to improve network performance. It is based on generating an underlying acyclic connected graph from the network graph and assigning a sequence number to each switch, which is used to remove cyclic dependencies. Evaluation results show that the routing algorithm based on the new methodology increases throughput by a factor of up to 2 in large networks, also reducing latency significantly.
This work was supported by the Spanish CICYT under Grant TIC97-0897-C04-01.
This is a preview of subscription content, log in via an institution to check access.
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
Abali, B.: A Deadlock Avoidance Method for Computer Networks. In: Panda, D.K., Stunkel, C.B. (eds.) CANPC 1997. LNCS, vol. 1199. Springer, Heidelberg (1997)
Alfaro, F.J., et al.: On the performance of up*/Down* Routing. In: Falsafi, B., Lauria, M. (eds.) CANPC 2000. LNCS, vol. 1797, pp. 61–72. Springer, Heidelberg (2000)
Arpaci-Duseau, A.C., et al.: High Performance sorting on networks of workstations. In: Proc. of ACM SIGMOD 1997 (1997)
Boden, N.J., et al.: Myrinet - A gigabit per second local area network. IEEE Micro 15 (1995)
Bollobas, B.: Graph Theory. Springer, New York Inc. (1979)
Cherkasova, L., Kotov, V., Rockicki, T.: Fibre channel fabrics: Evaluation and design. In: 29th Hawaii International Conference on System Sciences (1995)
Dally, W.J.: Network and Processor Architecture for Message-Driven Computing. In: Suaya, R., Birtwistle, G. (eds.) VLSI and Parallel Processing. Morgan Kaufmann, San Francisco (1990)
Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessors interconnection networks. IEEE Transactions 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)
García, D., Watson, W.: Servernet II. In: Proceedings of the 1997 Parallel Computer, Routing, and Communication Workshop (1997)
Kermani, P., Kleinrock, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks 3, 267–286 (1979)
Qiao, W., Ni., L.M.: Adaptive routing in irregular networks using cut-trough switches. In: Proc. of the 1996 Int. Conf. on Parallel Processing (1996)
Schroeder, M.D., et al.: Autonet: A high-speed, self-configuring local area network using point-to-point links, SRC research report 59 (December 1990)
Sheifert, P.: Gigabit Ethernet. Addison-Wesley, Reading (1998)
Silla, F., Duato, J.: Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology. In: Int. Conference on High Performance Computing (1997)
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
Sancho, J.C., Robles, A., Duato, J. (2000). A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks. In: Falsafi, B., Lauria, M. (eds) Network-Based Parallel Computing. Communication, Architecture, and Applications. CANPC 2000. Lecture Notes in Computer Science, vol 1797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720115_4
Download citation
DOI: https://doi.org/10.1007/10720115_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67879-3
Online ISBN: 978-3-540-44655-2
eBook Packages: Springer Book Archive