A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources

Authors:
J. Duato;T. M. Pinkston
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2001

Citing 42
Cited 21

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
High performance communications in processor networks

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes

IEEE Transactions on Computers
Chaos router: architecture and performance

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches

IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Compressionless routing: a framework for adaptive and fault-tolerant routing

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
The SP2 high-performance switch

IBM Systems Journal
A universal proof technique for deadlock-free routing in interconnection networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
An efficient, fully adaptive deadlock recovery scheme: DISHA

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
A necessary and sufficient condition for deadlock-free wormhole routing

Journal of Parallel and Distributed Computing
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing

IEEE Transactions on Parallel and Distributed Systems
On deadlocks in interconnection networks

Proceedings of the 24th annual international symposium on Computer architecture
The SGI Origin: a ccNUMA highly scalable server

Proceedings of the 24th annual international symposium on Computer architecture
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Characterization of Deadlocks in k-ary n-Cube Networks

IEEE Transactions on Parallel and Distributed Systems
Flexible and Efficient Routing Based on Progressive Deadlock Recovery

IEEE Transactions on Computers
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
A Delay Model for Router Microarchitectures

IEEE Micro
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems
The Impact of Pipelined Channels on k-ary n-Cube Networks

IEEE Transactions on Parallel and Distributed Systems
Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations

IEEE Transactions on Parallel and Distributed Systems
The Message Flow Model for Routing in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks

ICPP '97 Proceedings of the international Conference on Parallel Processing
DISHA: a deadlock recovery scheme for fully adaptive routing

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
ServerNet Deadlock Avoidance and Fractahedral Topologies

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery

IPPS '97 Proceedings of the 11th International Symposium 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
A Deadlock Avoidance Method for Computer Networks

CANPC '97 Proceedings of the First International Workshop on Communication and Architectural Support for Network-Based Parallel Computing
Optimized Routing in the Cray T3D

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks

HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
An adaptive deadlock and livelock free routing algorithm

PDP '95 Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing
Characterization of Deadlocks in Irregular Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
A Flow Control Mechanism to Avoid Message Deadlock in k-ary n-cube Networks

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing

A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability

IEEE Transactions on Parallel and Distributed Systems
Scalar Operand Networks

IEEE Transactions on Parallel and Distributed Systems
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
Distributed Resolution of Network Congestion and Potential Deadlock Using Reservation-Based Scheduling

IEEE Transactions on Parallel and Distributed Systems
Layered Routing in Irregular Networks

IEEE Transactions on Parallel and Distributed Systems
A survey of research and practices of Network-on-chip

ACM Computing Surveys (CSUR)
Mathematical performance modelling of adaptive wormhole routing in optoelectronic hypercubes

Journal of Parallel and Distributed Computing
An empirical performance analysis of minimal and non-minimal routing in cube-based OTIS multicomputers

Journal of High Speed Networks
Efficient Deadlock Detection in Parallel Computer Systems with Wormhole Routing

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A general mathematical performance model for wormhole-switched irregular networks

Cluster Computing
Blue Gene/L torus interconnection network

IBM Journal of Research and Development
An network reconfiguration strategy for customer requirements optimization

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A general methodology for direction-based irregular routing algorithms

Journal of Parallel and Distributed Computing
ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip

Proceedings of the 47th Design Automation Conference
Performance modeling of Cartesian product networks

Journal of Parallel and Distributed Computing
Modeling the effects of hot-spot traffic load on the performance of wormhole-switched hypermeshes

Computers and Electrical Engineering
Stream arbitration: Towards efficient bandwidth utilization for emerging on-chip interconnects

ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
NoRD: Node-Router Decoupling for Effective Power-gating of On-Chip Routers

MICRO-45 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
Bubble coloring: avoiding routing- and protocol-induced deadlocks with minimal virtual channel requirement

Proceedings of the 27th international ACM conference on International conference on supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a theoretical framework for the design of deadlock-free fully adaptive routing algorithms for a general class of network topologies and switching techniques in a single, unified theory. A general theory is proposed that allows the design of deadlock avoidance-based as well as deadlock recovery-based wormhole and virtual cut-through adaptive routing algorithms that use a homogeneous or a heterogeneous (mixed) set of resources. The theory also allows channel queues to be allocated nonatomically, utilizing resources efficiently. A general methodology for the design of fully adaptive routing algorithms applicable to arbitrary network topologies is also proposed. The proposed theory and methodology allow the design of efficient network routers that require minimal resources for handling infrequent deadlocks.