Pages that link to "Item:Q4727425"

The following pages link to Deadlock-Free Message Routing in Multiprocessor Interconnection Networks (Q4727425):

Displaying 50 items.

• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
• Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (Q437040) (← links)
• Augmented \(k\)-ary \(n\)-cubes (Q621635) (← links)
• Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks (Q645049) (← links)
• A general methodology for direction-based irregular routing algorithms (Q666078) (← links)
• Topological properties of the directional hypercube (Q673998) (← links)
• NuMesh: An architecture optimized for scheduled communication. (Q676259) (← links)
• Real-time analysis of priority-preemptive NoCs with arbitrary buffer sizes and router delays (Q777069) (← links)
• Deadlock-free connection-based adaptive routing with dynamic virtual circuits (Q868034) (← links)
• Deadlock-free routing in k-ary hypercube network in presence of processor failures (Q910198) (← links)
• A new general method to compute virtual channels occupancy probabilities in wormhole networks (Q941457) (← links)
• An introduction to compilation issues for parallel machines (Q973430) (← links)
• A deadlock-free communication kernel for loop architecture (Q1178215) (← links)
• Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network (Q1193126) (← links)
• Optimal routing in toroidal networks (Q1195485) (← links)
• Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419) (← links)
• Minimum deadlock-free message routing restrictions in binary hypercubes (Q1200146) (← links)
• Methods for message routing in parallel machines (Q1330418) (← links)
• Minimal fully adaptive wormhole routing on hypercubes (Q1330659) (← links)
• Optimal algorithms for dissemination of information in generalized communication modes (Q1339882) (← links)
• Methods and problems of communication in usual networks (Q1339884) (← links)
• Multiplicative circulant networks. Topological properties and communication algorithms (Q1364475) (← links)
• Efficient deadlock-free wormhole routing and virtual-channel reduction in shuffle-based networks (Q1384401) (← links)
• Deadlock prevention by acyclic orientations (Q1399106) (← links)
• A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels (Q1433280) (← links)
• A survey on interval routing (Q1575744) (← links)
• An optimal multicast algorithm for cube-connected cycles (Q1592639) (← links)
• Characterization of deadlocks in irregular networks (Q1604300) (← links)
• Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
• Deadlock-free message routing in multicomputer networks (Q1822919) (← links)
• Real-time application mapping for many-cores using a limited migrative model (Q2356297) (← links)
• A new approach to model virtual channels in interconnection networks (Q2459360) (← links)
• Communication delay analysis of fault-tolerant pipelined circuit switching in torus (Q2459362) (← links)
• Performance analysis of \(k\)-ary \(n\)-cube networks with pipelined circuit switching (Q2753611) (← links)
• Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks (Q3334062) (← links)
• Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
• A unified framework for off-line permutation routing in parallel networks (Q3357514) (← links)
• Routing multiple paths in hypercubes (Q3358210) (← links)
• Flit-serial packet routing on meshes and tori (Q3445270) (← links)
• The 2D SEM: A novel high-performance and low-power mesh-based topology for networks-on-chip (Q3585344) (← links)
• Efficient Parallel Buffer Structure and Its Management Scheme for a Robust Network-on-Chip (NoC) Architecture (Q3628468) (← links)
• Routing algorithms in honeycomb meshes (Q3645052) (← links)
• A message-routing strategy for multicomputer systems (Q4022729) (← links)
• (Q4281170) (← links)
• AN ADAPTIVE FAULT-TOLERANT WORMHOLE ROUTING ALGORITHM FOR HYPERCUBES (Q4550160) (← links)
• On the theory of interconnection networks for parallel computers (Q4632449) (← links)
• (Q4764001) (← links)
• Deadlock-free dynamic reconfiguration over InfiniBand™ NETWORKS (Q4823583) (← links)
• Deadlock-free interval routing schemes (Q5048937) (← links)