A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs
Issue No. 10 - Oct. (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.79
Antonio Robles-Gómez , Universidad Nacional de Educacio´n a Distancia (UNED), Madrid
Aurelio Bermúdez , Universidad de Castilla-La Mancha (UCLM), Albacete
Rafael Casado , Universidad de Castilla-La Mancha (UCLM), Albacete
Computer performance has significantly increased in recent years and, consequently, communication subsystems have become bottlenecks within systems. To counter this problem, current high-performance distributed systems employ switch-based interconnection networks. In this scenario, after the occurrence of a topological change, a management mechanism must reestablish connectivity between network devices. This requires performing a network reconfiguration, which consists in updating the routing function. The main challenge involved in network reconfiguration is the reduction of performance degradation during the change assimilation process. As shown in the performance evaluation section, former reconfiguration techniques significantly reduce network service since the application traffic is temporally stopped in order to avoid deadlocks. In addition, current solutions are only designed for networks that use distributed routing. In this paper, we propose and evaluate a first reconfiguration method for source routing networks that does not restrict the injection of packets during the change assimilation process. Without requiring additional network resources, our scheme is able to recover topology connectivity maintaining network throughput.
High-performance networks, fault tolerance, network management, dynamic reconfiguration, and performance evaluation.
A. Robles-Gómez, R. Casado and A. Bermúdez, "A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1641-1652, 2011.