Minimizing hotspot delay by fully utilizing the link bandwidth on 2d mesh with virtual cut-through switching

Authors:
MinHwan Ok;Myong-soon Park
Affiliations:
Department of Computer Science and Engineering, Korea University, Seoul, South Korea;Department of Computer Science and Engineering, Korea University, Seoul, South Korea
Venue:
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Year:
2005

Citing 14
Cited 0

Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network

IEEE Transactions on Parallel and Distributed Systems
The Chaos Router

IEEE Transactions on Computers
Synchronization hardware for networks of workstations: performance vs. cost

ICS '96 Proceedings of the 10th international conference on Supercomputing
The Case for Chaotic Adaptive Routing

IEEE Transactions on Computers
Barrier Synchronization on Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations

IEEE Transactions on Parallel and Distributed Systems
Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems

IEEE Transactions on Parallel and Distributed Systems
Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept

IEEE Transactions on Parallel and Distributed Systems
A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOWEnvironment

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Performance Analysis of a Minimal Adaptive Router

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Efficient and balanced adaptive routing in two-dimensional meshes

HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Switches and Switch Interconnects

MPPOI '97 Proceedings of the 4th International Conference on Massively Parallel Processing Using Optical Interconnections
BLAM: A High-Performance Routing Algorithm for Virtual Cut-Through Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topology a reasonable method is fully utilizing all the links of the hotspot node. A new routing method that incorporates both minimal routes and non-minimal routes was proposed and approved with the hotspot traffic patterns. In particular the routing method decide on misrouting without the congestion detection. The routing method requires only little addition of hardware and it is relatively simple.