Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th 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
An efficient, fully adaptive deadlock recovery scheme: DISHA
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
On deadlocks in interconnection networks
Proceedings of the 24th annual international symposium on Computer architecture
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
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
Characterization of Deadlocks in Interconnection Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Efficient Tree-based Multicast in Wormhole-Routed 2D Meshes
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
A Dynamic, Cut-Through Communications Protocol with Multicast
A Dynamic, Cut-Through Communications Protocol with Multicast
LIFE: a Limited Injection, Fully adaptivE, Recovery-Based Routing Algorithm
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
A New Conference Network for Group Communication
IEEE Transactions on Computers
Multicast routing with dynamic packet fragmentation
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Adaptive and deadlock-free tree-based multicast routing for networks-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A routing algorithm for multicast on hypercube multi-core architecture
Journal of Embedded Computing - Advanced Topics on Embedded Computing
Power-efficient tree-based multicast support for networks-on-chip
Proceedings of the 16th Asia and South Pacific Design Automation Conference
On high performance multicast algorithms for interconnection networks
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Microprocessors & Microsystems
Design and analysis of multicast communication in multidimensional mesh networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 14.98 |
Multicast communication is a key issue in almost all applications that run on any parallel architecture and, hence, efficient implementation of of multicast is critical to the performance of multiprocessor machines. Multicast is implemented in parallel architectures either via software or via hardware. Software-based approaches for implementing multicast can result in high message latencies, while hardware-based schemes can greatly improve performance. Deadlock freedom in multicast communication is much more difficult to achieve resulting in more involved routing algorithms and higher startup delays. Hardware tree-based algorithms do not require these high startup delays, but do suffer from high probabilities of message blocking leading to poor performance. In this paper, we propose a new hardware tree-based routing algorithm (HTA) for multicast communication under virtual cut-through switching in k-ary n-cubes that outperforms existing software and hardware path-based multicast routing schemes. Simulation results are compared against several commonly used multicast routing algorithms and show that HTA performs extremely well under many different conditions.