Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
From MaRDI portal
Recommendations
- Deadlock-free message routing in multicomputer networks
- A generic design methodology for deadlock-free routing in multicomputer networks
- Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
- A deadlock free and starvation free network of packet switching communication processors
- Deadlock-free interval routing schemes
- scientific article; zbMATH DE number 1340884
- Deadlock-free routing in k-ary hypercube network in presence of processor failures
Cited in
(63)- A deadlock-free communication kernel for loop architecture
- Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network
- Optimal routing in toroidal networks
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Minimum deadlock-free message routing restrictions in binary hypercubes
- Methods for message routing in parallel machines
- Minimal fully adaptive wormhole routing on hypercubes
- Optimal algorithms for dissemination of information in generalized communication modes
- Methods and problems of communication in usual networks
- Multiplicative circulant networks. Topological properties and communication algorithms
- Deadlock prevention by acyclic orientations
- A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels
- A survey on interval routing
- An optimal multicast algorithm for cube-connected cycles
- Characterization of deadlocks in irregular networks
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Deadlock-free message routing in multicomputer networks
- Real-time application mapping for many-cores using a limited migrative model
- A new approach to model virtual channels in interconnection networks
- Communication delay analysis of fault-tolerant pipelined circuit switching in torus
- Performance analysis of k-ary n-cube networks with pipelined circuit switching
- Communication algorithms in k-ary n-cube interconnection networks
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
- Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks
- Using Barrier Graphs for Deadlock Prevention in Communication Networks
- Fast algorithms for bit-serial routing on a hypercube
- A unified framework for off-line permutation routing in parallel networks
- Routing multiple paths in hypercubes
- Flit-serial packet routing on meshes and tori
- A foundation for designing deadlock-free routing algorithms in wormhole networks
- The 2D SEM: A novel high-performance and low-power mesh-based topology for networks-on-chip
- Efficient Parallel Buffer Structure and Its Management Scheme for a Robust Network-on-Chip (NoC) Architecture
- Routing algorithms in honeycomb meshes
- A message-routing strategy for multicomputer systems
- scientific article; zbMATH DE number 510703 (Why is no real title available?)
- Requirements for Deadlock-Free, Adaptive Packet Routing
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
- Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
- AN ADAPTIVE FAULT-TOLERANT WORMHOLE ROUTING ALGORITHM FOR HYPERCUBES
- On the theory of interconnection networks for parallel computers
- scientific article; zbMATH DE number 749818 (Why is no real title available?)
- Deadlock-free dynamic reconfiguration over InfiniBand™ NETWORKS
- Deadlock-free interval routing schemes
- Modeling Cache Coherence to Expose
- Communication throughput of interconnection networks
- Performance analysis of wormhole routed k-ary n-trees
- A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
- Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
- The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes
- A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks
- Communication in the two-way listen-in vertex-disjoint paths mode
- On the benefit of supporting virtual channels in wormhole routers
- A generic design methodology for deadlock-free routing in multicomputer networks
- Augmented \(k\)-ary \(n\)-cubes
- Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
- A general methodology for direction-based irregular routing algorithms
- Topological properties of the directional hypercube
- NuMesh: An architecture optimized for scheduled communication.
- Real-time analysis of priority-preemptive NoCs with arbitrary buffer sizes and router delays
- Deadlock-free connection-based adaptive routing with dynamic virtual circuits
- Deadlock-free routing in k-ary hypercube network in presence of processor failures
- A new general method to compute virtual channels occupancy probabilities in wormhole networks
- An introduction to compilation issues for parallel machines
This page was built for publication: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4727425)
