Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
TNet: A Reliable System Area Network
IEEE Micro
Spider: A High-Speed Network Interconnect
IEEE Micro
Improving Performance of Networks of Workstations by using Disha Concurrent
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Efficient Adaptive Routing in Networks of Workstations with Irregular Topology
CANPC '97 Proceedings of the First International Workshop on Communication and Architectural Support for Network-Based Parallel Computing
Deadlock-Free Routing in Irregular Networks with Dynamic Reconfiguration
CANPC '99 Proceedings of the Third International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
Is It Worth the Flexibility Provided by Irregular Topologies in Networks of Workstations?
CANPC '99 Proceedings of the Third International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
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
Fibre Channel Fabrics: Evaluation and Design
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
A Clustering Approach in Characterizing Interconnection Networks
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Virtual Channel Multiplexing in Networks of Workstations with Irregular Topology
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Characterization of Deadlocks in Irregular Networks
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Performance Evaluation of Real-Time Communication Services on High-Speed LANs under Topology Changes
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
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
On Deadlock Frequency during Dynamic Reconfiguration in NOWs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
The Journal of Supercomputing
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
IEEE Transactions on Parallel and Distributed Systems
Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
IEEE Transactions on Parallel and Distributed Systems
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
Trends toward on-chip networked microsystems
International Journal of High Performance Computing and Networking
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
Application-aware deadlock-free oblivious routing
Proceedings of the 36th annual international symposium on Computer architecture
Implementing a Change Assimilation Mechanism for Source Routing Interconnects
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Efficient network management applied to source routed networks
Parallel Computing
Simple deadlock-free dynamic network reconfiguration
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
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.01 |
Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes in irregular topologies. During reconfiguration of a network based on virtual cut-through or wormhole switching, however, deadlocks in the transition phase between the old and the new routing function must be avoided. The avoidance of such deadlocks will in general make the performance of the network suffer during reconfiguration. Keeping reconfiguration time as short as possible, and leaving as much as possible of the network untouched is therefore of importance.We propose a method for dynamic reconfiguration of networks using up*/down* routing that aims at reducing the consequences of reconfiguration. Identifying a restricted part of the network, the skyline, as the only part where a full reconfiguration is necessary, does this. This means that most of the network does not need to take part in the reconfiguration at all (other than adding entries for new nodes, and removing entries for removed nodes).Experiments show that for the most frequent configuration changes the skyline will be empty in 85-95% of the cases, leaving the whole of the network operational through the entire reconfiguration. For the most dramatic changes in topology - the addition of a link connecting two previously disjoint networks - an average of 90% of the links can start using the new routing function immediately for some topologies. Our approach is in principle orthogonal to other approaches, thus existing methods for dynamic reconfiguration can be applied in the reconfiguration of the skyline.