The forwarding index of communication networks
IEEE Transactions on Information Theory
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
On forwarding indices of networks
Discrete Applied Mathematics
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Requirements for deadlock-free, adaptive packet routing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Routing function and deadlock avoidance in a star graph interconnection network
Journal of Parallel and Distributed Computing
The turn model for adaptive routing
Journal of the ACM (JACM)
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
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
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
A necessary and sufficient condition for deadlock-free wormhole routing
Journal of Parallel and Distributed Computing
Parallel programming with MPI
Deadlock-free oblivious wormhole routing with cyclic dependencies
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing
IEEE Transactions on Parallel and Distributed Systems
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 Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole 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
Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
Generic Methodologies for Deadlock-Free Routing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Theoretical Aspects
EDMCC2 Proceedings of the 2nd Euronean Conference on Distributed Memory Computing
On the Theory of Interconnection Networks for Parallel Computers
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
A Foundation for Designing Deadlock-free Routing Algorithms in Wormhole Networks
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Bounds on evacuation time for deflection routing
Distributed Computing
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
The Multi-Level Communication: Efficient Routing for Interconnection Networks
The Journal of Supercomputing
A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
IEEE Transactions on Computers
ICS '02 Proceedings of the 16th international conference on Supercomputing
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes
Journal of Computer Science and Technology
A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model
IEEE Transactions on Computers
Hardware for multiconnected networks: the design flow
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Deadlock-free routing and component placement for irregular mesh-based networks-on-chip
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
A tool for automatic detection of deadlock in wormhole networks on chip
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Extended minimal routing in 2-D meshes with faulty blocks
International Journal of High Performance Computing and Networking
Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions
Journal of Systems Architecture: the EUROMICRO Journal
Formal validation of deadlock prevention in networks-on-chips
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Formal specification of networks-on-chips: deadlock and evacuation
Proceedings of the Conference on Design, Automation and Test in Europe
NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An accurate performance model for network-on-chip and multicomputer interconnection networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.02 |
Most machines of the last generation of distributed memory parallel computers possess specific routers which are used to exchange messages between nonneighboring nodes in the network. Among the several technologies, wormhole routing is usually preferred because it allows low channel-setup time and reduces the dependency between latency and internode distance. However, wormhole routing is very susceptible to deadlock because messages are allowed to hold many resources while requesting others. Therefore, designing deadlock-free routing algorithms using few hardware facilities is a major problem for wormhole-routed networks. In this paper, we describe a general theoretical framework for the study of deadlock-free routing functions. We give a general definition of what can be a routing function. This definition captures many specific definitions of the literature (e.g., vertex-dependent, input-dependent, source-dependent, path-dependent, etc.). Using our definition, we give a necessary and sufficient condition which characterizes deadlock-free routing functions. Our theory embraces, at a high level, most of the theories related to deadlock avoidance in wormhole-routed networks previously derived in the literature. In particular, it applies not only to one-to-one routing, but also to one-to-many routing. The latter paradigm is used to solve the multicast problem with the path-based or tree-based facility.