Amanote Research
Register
Sign In
A Simple Mathematical Model of Adaptive Routing in Wormhole K-Ary N-Cubes
doi 10.1145/508791.508954
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2002
Authors
H. Sarbazi-Azad
M. Ould-Khaoua
Publisher
ACM Press
Related search
Resource Placement With Multiple Adjacency Constraints in K-Ary N-Cubes
IEEE Transactions on Parallel and Distributed Systems
Hardware
Computational Theory
Signal Processing
Architecture
Mathematics
Alleviating Consumption Channel Bottleneck in Wormhole Routed K-Ary N-Cube Systems
IEEE Transactions on Parallel and Distributed Systems
Hardware
Computational Theory
Signal Processing
Architecture
Mathematics
Optimal Fully Adaptive Minimal Wormhole Routing for Meshes
Journal of Parallel and Distributed Computing
Computer Networks
Hardware
Communications
Architecture
Theoretical Computer Science
Artificial Intelligence
Software
Scheduling Collective Communications on Wormhole Fat Cubes
The Message Flow Model for Routing in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Hardware
Computational Theory
Signal Processing
Architecture
Mathematics
Association-Oriented Database Model — N-Ary Associations
International Journal of Software Engineering and Knowledge Engineering
Computer Graphics
Computer Networks
Communications
Computer-Aided Design
Artificial Intelligence
Software
Design of a Circuit-Switched Highly Fault-Tolerant K-Ary N-Cube
A Mathematical Model for In-Plant Milk-Run Routing
Pamukkale University Journal of Engineering Sciences
Deadlock Prevention With Wormhole Routing
Distributed Computing Innovations for Business, Engineering, and Science
