Path selection algorithm: The strategy for designing deterministic routing from alternative paths

Michihiro Koibuchi, Akiya Jouraku, Hideharu Amano

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept only deterministic routings. Thus, path selection algorithm, which chooses a single path from alternative paths, becomes essential for advanced routings in SANs. However, a few studies of it have been done only for SANs without virtual channels, and its impact is not well analyzed. In this paper, (1) we propose four path selection algorithms which have different concepts to distribute paths in SANs with virtual channels, and (2) we investigate the performance influences of various path selection algorithms through a flit-level simulation. Simulation results show that one of the four algorithms improves up to 92% of throughput against simple path selection algorithms, and policies to remove paths crossing the bottleneck channels are more efficient than ones to keep paths crossing channels that are not crowded.

Original languageEnglish
Pages (from-to)117-130
Number of pages14
JournalParallel Computing
Volume31
Issue number1
DOIs
Publication statusPublished - 2005 Jan

Fingerprint

Routing
Path
Alternatives
HPSS
Virtual Channel
Routing algorithms
Throughput
Topology
Strategy
Storage System
Routing Algorithm
Irregular
Simulation
High Performance
Choose
Vertex of a graph

Keywords

  • Deterministic routing
  • Interconnection networks
  • Path selection algorithm
  • System Area Networks
  • Virtual channels

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Path selection algorithm : The strategy for designing deterministic routing from alternative paths. / Koibuchi, Michihiro; Jouraku, Akiya; Amano, Hideharu.

In: Parallel Computing, Vol. 31, No. 1, 01.2005, p. 117-130.

Research output: Contribution to journalArticle

@article{43cae6c185e44c699efc2b3192fb1faf,
title = "Path selection algorithm: The strategy for designing deterministic routing from alternative paths",
abstract = "System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept only deterministic routings. Thus, path selection algorithm, which chooses a single path from alternative paths, becomes essential for advanced routings in SANs. However, a few studies of it have been done only for SANs without virtual channels, and its impact is not well analyzed. In this paper, (1) we propose four path selection algorithms which have different concepts to distribute paths in SANs with virtual channels, and (2) we investigate the performance influences of various path selection algorithms through a flit-level simulation. Simulation results show that one of the four algorithms improves up to 92{\%} of throughput against simple path selection algorithms, and policies to remove paths crossing the bottleneck channels are more efficient than ones to keep paths crossing channels that are not crowded.",
keywords = "Deterministic routing, Interconnection networks, Path selection algorithm, System Area Networks, Virtual channels",
author = "Michihiro Koibuchi and Akiya Jouraku and Hideharu Amano",
year = "2005",
month = "1",
doi = "10.1016/j.parco.2004.11.003",
language = "English",
volume = "31",
pages = "117--130",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Path selection algorithm

T2 - The strategy for designing deterministic routing from alternative paths

AU - Koibuchi, Michihiro

AU - Jouraku, Akiya

AU - Amano, Hideharu

PY - 2005/1

Y1 - 2005/1

N2 - System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept only deterministic routings. Thus, path selection algorithm, which chooses a single path from alternative paths, becomes essential for advanced routings in SANs. However, a few studies of it have been done only for SANs without virtual channels, and its impact is not well analyzed. In this paper, (1) we propose four path selection algorithms which have different concepts to distribute paths in SANs with virtual channels, and (2) we investigate the performance influences of various path selection algorithms through a flit-level simulation. Simulation results show that one of the four algorithms improves up to 92% of throughput against simple path selection algorithms, and policies to remove paths crossing the bottleneck channels are more efficient than ones to keep paths crossing channels that are not crowded.

AB - System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept only deterministic routings. Thus, path selection algorithm, which chooses a single path from alternative paths, becomes essential for advanced routings in SANs. However, a few studies of it have been done only for SANs without virtual channels, and its impact is not well analyzed. In this paper, (1) we propose four path selection algorithms which have different concepts to distribute paths in SANs with virtual channels, and (2) we investigate the performance influences of various path selection algorithms through a flit-level simulation. Simulation results show that one of the four algorithms improves up to 92% of throughput against simple path selection algorithms, and policies to remove paths crossing the bottleneck channels are more efficient than ones to keep paths crossing channels that are not crowded.

KW - Deterministic routing

KW - Interconnection networks

KW - Path selection algorithm

KW - System Area Networks

KW - Virtual channels

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

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

U2 - 10.1016/j.parco.2004.11.003

DO - 10.1016/j.parco.2004.11.003

M3 - Article

AN - SCOPUS:14644432353

VL - 31

SP - 117

EP - 130

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 1

ER -