FIR: an efficient routing strategy for tori and meshes

Authors:
M. E. Gómez;P. López;J. Duato
Affiliations:
Department of Computer Engineering, Universidad Politécnica de Valencia, Valencia, Spain;Department of Computer Engineering, Universidad Politécnica de Valencia, Valencia, Spain;Department of Computer Engineering, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Year:
2006

Citing 14
Cited 0

Interval routing

The Computer Journal
The turn model for adaptive routing

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
Networks, Routers and Transputers: Function, Performance and Applications

Networks, Routers and Transputers: Function, Performance and Applications
Routing in distributed networks: overview and open problems

ACM SIGACT News
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Spider: A High-Speed Network Interconnect

IEEE Micro
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
A Flow Control Mechanism to Avoid Message Deadlock in k-ary n-cube Networks

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Supporting adaptive routing in IBA switches

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Evolutions in parallel distributed and network-based processing
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori

IEEE Computer Architecture Letters
Increasing the adaptivity of routing algorithms for k-ary n-cubes

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent massively parallel computers are based on clusters of PCs. These machines use one of the recently proposed standard interconnects. These interconnects either use source routing or distributed routing based on forwarding tables. While source routers are simpler, distributed routers provides more flexibility allowing the network to achieve a higher performance. Distributed routing can be implemented by a fixed hardware specific to a routing function on a given topology or by using forwarding tables. The main problem of this approach is the lack of scalability of forwarding tables. In this paper, we propose a distributed routing strategy for commercial switches, flexible interval routing, that is scalable, both in memory and routing time because it is not based on tables. At the same time, the strategy is easy to reconfigure, being able to implement the most commonly used routing algorithms in the most widely used regular topologies.