Routing algorithms for tree-hypercube networks

Authors:
Mahmoud Al-Omari;Hani Abu-Salem
Affiliations:
Computer Science Department, Mu'tah University, P.O.Box 7, Mu'tah, Karak, Jordan;Computer Science Department, Mu'tah University, P.O.Box 7, Mu'tah, Karak, Jordan
Venue:
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Year:
1998

Citing 8
Cited 0

Data communication in hypercubes

Journal of Parallel and Distributed Computing
Intensive hypercube communication. Prearranged communication in link-bound machines

Journal of Parallel and Distributed Computing
Disjoint path properties of the data manipulator network family

Journal of Parallel and Distributed Computing
Tree-hypercube: hierarchical, partitionable multiprocessor interconnection network

Tree-hypercube: hierarchical, partitionable multiprocessor interconnection network
Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks

IEEE Transactions on Computers
Selective Broadcast Data Distribution Systems

IEEE Transactions on Computers
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Nearest Neighbors in Random Subspaces

SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract