A method of trading diameter for reduced degree to construct low cost interconnection networks

Authors:
Aaron Harwood;Hong Shen
Affiliations:
School of Computing and Information Technology, School of Microelectronic Engineering, Griffith University, Nathan, QLD 4111, AUSTRALIA;School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, AUSTRALIA
Venue:
Proceedings of the 1999 ACM symposium on Applied computing
Year:
1999

The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network

IEEE Transactions on Computers
Cost-performance tradeoffs for interconnection networks

Discrete Applied Mathematics - Special double volume: interconnection networks
Scalable load balancing techniques for parallel computers

Journal of Parallel and Distributed Computing
A massively parallel fault-tolerant architecture for time-critical computing

The Journal of Supercomputing - Special issue: trends in parallel operating systems
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network

IEEE Transactions on Parallel and Distributed Systems
Modifying Networks to Obtain Low Cost Trees

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Hierarchical Swapped Networks: Efficient Low-Degree Alternatives to Hypercubes and Generalized Hypercubes

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks

Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks

Hi-index	0.00