An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks

Akiya Jouraku, Michihiro Koibuchi, Hideharu Amano

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

System area networks (SANs), which usually accept arbitrary topologies, have been used to connect hosts in PC clusters. Although deadlock-free routing is often employed for low-latency communications using wormhole or virtual cut-through switching, the interconnection adaptivity introduces difficulties in establishing deadlock-free paths. An up*/down* routing algorithm, which has been widely used to avoid deadlocks in irregular networks, tends to make unbalanced paths as it employs a one-dimensional directed graph. The current study introduces a two-dimensional directed graph on which adaptive routings called left-up first turn (L-turn) routings and right-down last turn (R-turn) routings are proposed to make the paths as uniformly distributed as possible. This scheme guarantees deadlock-freedom because it uses the turn model approach, and the extra degree of freedom in the two-dimensional graph helps to ensure that the prohibited turns are well-distributed. Simulation results show that better throughput and latency results from uniformly distributing the prohibited turns by which the traffic would be more distributed toward the leaf nodes. The L-turn routings, which meet this condition, improve throughput by up to 100 percent compared with two up*/down*-based routings, and also reduce latency.

Original languageEnglish
Pages (from-to)320-333
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume18
Issue number3
DOIs
Publication statusPublished - 2007 Mar

Fingerprint

Directed graphs
Deadlock
Routing algorithms
Routing Algorithm
Irregular
Routing
Throughput
Latency
Directed Graph
Path
Topology
Communication
Adaptive Routing
PC Cluster
Wormhole
Model
Adaptivity
Interconnection
Percent
Leaves

Keywords

  • Adaptive routing
  • Deadlock avoidance
  • Interconnection networks
  • Irregular topologies
  • PC clusters
  • System area networks
  • Turn model

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks. / Jouraku, Akiya; Koibuchi, Michihiro; Amano, Hideharu.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 3, 03.2007, p. 320-333.

Research output: Contribution to journalArticle

@article{d14e748796824fa7a1a5247325f22d67,
title = "An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks",
abstract = "System area networks (SANs), which usually accept arbitrary topologies, have been used to connect hosts in PC clusters. Although deadlock-free routing is often employed for low-latency communications using wormhole or virtual cut-through switching, the interconnection adaptivity introduces difficulties in establishing deadlock-free paths. An up*/down* routing algorithm, which has been widely used to avoid deadlocks in irregular networks, tends to make unbalanced paths as it employs a one-dimensional directed graph. The current study introduces a two-dimensional directed graph on which adaptive routings called left-up first turn (L-turn) routings and right-down last turn (R-turn) routings are proposed to make the paths as uniformly distributed as possible. This scheme guarantees deadlock-freedom because it uses the turn model approach, and the extra degree of freedom in the two-dimensional graph helps to ensure that the prohibited turns are well-distributed. Simulation results show that better throughput and latency results from uniformly distributing the prohibited turns by which the traffic would be more distributed toward the leaf nodes. The L-turn routings, which meet this condition, improve throughput by up to 100 percent compared with two up*/down*-based routings, and also reduce latency.",
keywords = "Adaptive routing, Deadlock avoidance, Interconnection networks, Irregular topologies, PC clusters, System area networks, Turn model",
author = "Akiya Jouraku and Michihiro Koibuchi and Hideharu Amano",
year = "2007",
month = "3",
doi = "10.1109/TPDS.2007.36",
language = "English",
volume = "18",
pages = "320--333",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks

AU - Jouraku, Akiya

AU - Koibuchi, Michihiro

AU - Amano, Hideharu

PY - 2007/3

Y1 - 2007/3

N2 - System area networks (SANs), which usually accept arbitrary topologies, have been used to connect hosts in PC clusters. Although deadlock-free routing is often employed for low-latency communications using wormhole or virtual cut-through switching, the interconnection adaptivity introduces difficulties in establishing deadlock-free paths. An up*/down* routing algorithm, which has been widely used to avoid deadlocks in irregular networks, tends to make unbalanced paths as it employs a one-dimensional directed graph. The current study introduces a two-dimensional directed graph on which adaptive routings called left-up first turn (L-turn) routings and right-down last turn (R-turn) routings are proposed to make the paths as uniformly distributed as possible. This scheme guarantees deadlock-freedom because it uses the turn model approach, and the extra degree of freedom in the two-dimensional graph helps to ensure that the prohibited turns are well-distributed. Simulation results show that better throughput and latency results from uniformly distributing the prohibited turns by which the traffic would be more distributed toward the leaf nodes. The L-turn routings, which meet this condition, improve throughput by up to 100 percent compared with two up*/down*-based routings, and also reduce latency.

AB - System area networks (SANs), which usually accept arbitrary topologies, have been used to connect hosts in PC clusters. Although deadlock-free routing is often employed for low-latency communications using wormhole or virtual cut-through switching, the interconnection adaptivity introduces difficulties in establishing deadlock-free paths. An up*/down* routing algorithm, which has been widely used to avoid deadlocks in irregular networks, tends to make unbalanced paths as it employs a one-dimensional directed graph. The current study introduces a two-dimensional directed graph on which adaptive routings called left-up first turn (L-turn) routings and right-down last turn (R-turn) routings are proposed to make the paths as uniformly distributed as possible. This scheme guarantees deadlock-freedom because it uses the turn model approach, and the extra degree of freedom in the two-dimensional graph helps to ensure that the prohibited turns are well-distributed. Simulation results show that better throughput and latency results from uniformly distributing the prohibited turns by which the traffic would be more distributed toward the leaf nodes. The L-turn routings, which meet this condition, improve throughput by up to 100 percent compared with two up*/down*-based routings, and also reduce latency.

KW - Adaptive routing

KW - Deadlock avoidance

KW - Interconnection networks

KW - Irregular topologies

KW - PC clusters

KW - System area networks

KW - Turn model

UR - http://www.scopus.com/inward/record.url?scp=33947380647&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947380647&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2007.36

DO - 10.1109/TPDS.2007.36

M3 - Article

VL - 18

SP - 320

EP - 333

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 3

ER -