RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration

  • Authors:
  • Åshild Grønstad Solheim;Olav Lysne;Tor Skeie

  • Affiliations:
  • Simula Research Laboratory, Networks and Distributed Systems Group, Lysaker, Norway and Department of Informatics, University of Oslo, Oslo, Norway;Simula Research Laboratory, Networks and Distributed Systems Group, Lysaker, Norway and Department of Informatics, University of Oslo, Oslo, Norway;Simula Research Laboratory, Networks and Distributed Systems Group, Lysaker, Norway and Department of Informatics, University of Oslo, Oslo, Norway

  • Venue:
  • Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reconfiguration of an interconnection network is fundamental for the provisioning of a reliable service. Current reconfiguration methods either include deadlock-avoidance mechanisms that impose performance penalties during the reconfiguration, or are tied to the Up*/Down* routing algorithm which achieves relatively low performance. In addition, some of the methods require complex network switches, and some are limited to distributed routing systems. This paper presents a new dynamic reconfiguration method, RecTOR, which ensures deadlock-freedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. Moreover, it is based on a simple concept, is easy to implement, is applicable for both source and distributed routing systems, and assumes Transition-Oriented Routing which achieves excellent performance. Our simulation results confirm that RecTOR supports a better network service to the applications than Overlapping Reconfiguration does.