Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Automatic reconfiguration in Autonet
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Hardware fault containment in scalable shared-memory multiprocessors
Proceedings of the 24th annual international symposium on Computer architecture
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
A New Approach to Provide Real-Time Services on High-Speed Local Area Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Dynamic Reconfiguration in High-Speed Computer Clusters
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
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
A Routing Methodology for Achieving Fault Tolerance in Direct Networks
IEEE Transactions on Computers
Reachability-Based Fault-Tolerant Routing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
FRoots: A Fault Tolerant and Topology-Flexible Routing Technique
IEEE Transactions on Parallel and Distributed Systems
Handling Topology Changes in InfiniBand
IEEE Transactions on Parallel and Distributed Systems
A distributed approach to handle topological changes in advanced switching
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A proposal for managing ASI fabrics
Journal of Systems Architecture: the EUROMICRO Journal
Model-Based Analysis of Network Reconfigurations Using Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A new distributed management mechanism for ASI based networks
Computer Communications
RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A scalable methodology for computing fault-free paths in InfiniBand torus networks
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Model-based stochastic simulation of P2P VoIP using graph transformation system
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and Tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection Networks
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 0.00 |
Dynamic reconfiguration of interconnection networks is defined as the process of changing from one routing function to another while the network remains up and running The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal Current approaches fall in one of two categories Either they require the existence of extra network resources like e.g virtual channels, or their complexity is so high that their practical applicability is limited In this paper we describe a simple and powerful method for dynamic networks reconfiguration It guarantees a fast and deadlock-free transition from the old to the new routing function, it works for any topology and between any pair of old and new routing functions, and it guarantees in-order packet delivery when used between deterministic routing functions.