Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks
IEEE Transactions on Parallel and Distributed Systems
A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks
CANPC '00 Proceedings of the 4th International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
Fast Dynamic Reconfiguration in Irregular Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Fast Routing Computation on InfiniBand Networks
IEEE Transactions on Parallel and Distributed Systems
An Efficient and Deadlock-Free Network Reconfiguration Protocol
IEEE Transactions on Computers
A proposal for managing ASI fabrics
Journal of Systems Architecture: the EUROMICRO Journal
Deadlock-Free Dynamic Network Reconfiguration Based on Close Up*/Down* Graphs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
A new distributed management mechanism for ASI based networks
Computer Communications
A model for the development of AS fabric management protocols
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Autonet: a high-speed, self-configuring local area network using point-to-point links
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Current high-performance interconnects are switch-based systems using either distributed or source routing. They usually incorporate a set of management mechanisms in charge of detecting and assimilating any topological change. When a change occurs, in order to restore the connectivity among endpoints, these mechanisms must obtain the resulting topology, and compute and distribute a new set of valid fabric paths. It is desirable that the change assimilation process is fast, deadlock-free and with reduced contribution to the network service degradation. Traditional proposals, which are related to the path distribution phase, are only focused on networks that use distributed routing and, therefore, they are not directly applicable to source routed environments. The objective of this paper is to present and evaluate an efficient network management scheme applied to source routed networks, incorporating several mechanisms for all phases involved in the change assimilation process. The main novelty of this scheme is the proposal of a mechanism to dynamically update the routing paths.