Weighted Random Routing on Torus Networks

Weighted Random Routing on Torus Networks

In this paper, we introduce a new closed-form oblivious routing algorithm called W2TURN that is worst-case throughput optimal for 2D-torus networks. W2TURN is based on a weighted random selection of paths that contain at most two turns. In terms of average hop count, W2TURN outperforms the best prev...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE computer architecture letters 2009-01, Vol.8 (1), p.1-4
Hauptverfasser: Sunkam Ramanujam, Rohit, Lin, Bill
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Algorithms
Architecture
Computer networks
Counting
Data communications
Delay
Exact solutions
Mathematical analysis
Measurement
Multiprocessor interconnection networks
Network-on-a-chip
Networks
Oblivious Routing
On-chip interconnection networks
Optimization
Routing
Routing (telecommunications)
Runtime
System recovery
Throughput
Torus Network
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we introduce a new closed-form oblivious routing algorithm called W2TURN that is worst-case throughput optimal for 2D-torus networks. W2TURN is based on a weighted random selection of paths that contain at most two turns. In terms of average hop count, W2TURN outperforms the best previously known closed-form worst-case throughput optimal routing algorithm called IVAL. In addition, we present a new optimal weighted random routing algorithm for rings called WRD.
ISSN:1556-6056
1556-6064
DOI:10.1109/L-CA.2008.14