Designing High-Performance Interconnection Networks with Host-Switch Graphs

Ryota Yasudo, Michihiro Koibuchi, Koji Nakano, Hiroki Matsutani, Hideharu Amano

Research output: Contribution to journalArticle

Abstract

This paper aims at establishing a method for designing high-performance network topologies to bridge a gap between theoretical and practical studies. To this end, we present a novel graph called a host-switch graph, which consists of host vertices and switch vertices with maximum degree 1 and r, respectively. This graph represents a network topology of a practical parallel/distributed computer system with host computers connected by r-port switches. We discuss important metrics for designing high performance interconnection networks: the host-to-host average shortest path length (h-ASPL) and the bisection width (BiW). In particular, we explore a method for constructing host-switch graphs with low h-ASPL and high BiW that connect the fixed number of hosts via any number of r-port switches. We demonstrate that the number of switches that provides the minimum h-ASPL can mathematically be approximated, and the minimum number of switches that provides a certain BiW can experimentally be approximated. On the basis of the approximations, we propose a randomized algorithm for searching host-switch graphs. We then apply the graphs to interconnection networks and compare them with typical network topologies. As compared with the torus, the dragonfly, and the fat-tree, our networks attain higher performance and smaller power and costs.

Original languageEnglish
JournalIEEE Transactions on Parallel and Distributed Systems
DOIs
Publication statusAccepted/In press - 2018 Aug 6

Fingerprint

Switches
Topology
Distributed computer systems
Network performance
Oils and fats
Costs

Keywords

  • average shortest path length
  • bisection width
  • Computational modeling
  • Graph theory
  • interconnection network
  • Multiprocessor interconnection
  • Network topology
  • Network topology
  • optimization
  • Switches
  • Topology
  • Upper bound

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Designing High-Performance Interconnection Networks with Host-Switch Graphs. / Yasudo, Ryota; Koibuchi, Michihiro; Nakano, Koji; Matsutani, Hiroki; Amano, Hideharu.

In: IEEE Transactions on Parallel and Distributed Systems, 06.08.2018.

Research output: Contribution to journalArticle

@article{c051723177f44d6fb61e253777e58d05,
title = "Designing High-Performance Interconnection Networks with Host-Switch Graphs",
abstract = "This paper aims at establishing a method for designing high-performance network topologies to bridge a gap between theoretical and practical studies. To this end, we present a novel graph called a host-switch graph, which consists of host vertices and switch vertices with maximum degree 1 and r, respectively. This graph represents a network topology of a practical parallel/distributed computer system with host computers connected by r-port switches. We discuss important metrics for designing high performance interconnection networks: the host-to-host average shortest path length (h-ASPL) and the bisection width (BiW). In particular, we explore a method for constructing host-switch graphs with low h-ASPL and high BiW that connect the fixed number of hosts via any number of r-port switches. We demonstrate that the number of switches that provides the minimum h-ASPL can mathematically be approximated, and the minimum number of switches that provides a certain BiW can experimentally be approximated. On the basis of the approximations, we propose a randomized algorithm for searching host-switch graphs. We then apply the graphs to interconnection networks and compare them with typical network topologies. As compared with the torus, the dragonfly, and the fat-tree, our networks attain higher performance and smaller power and costs.",
keywords = "average shortest path length, bisection width, Computational modeling, Graph theory, interconnection network, Multiprocessor interconnection, Network topology, Network topology, optimization, Switches, Topology, Upper bound",
author = "Ryota Yasudo and Michihiro Koibuchi and Koji Nakano and Hiroki Matsutani and Hideharu Amano",
year = "2018",
month = "8",
day = "6",
doi = "10.1109/TPDS.2018.2864286",
language = "English",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Designing High-Performance Interconnection Networks with Host-Switch Graphs

AU - Yasudo, Ryota

AU - Koibuchi, Michihiro

AU - Nakano, Koji

AU - Matsutani, Hiroki

AU - Amano, Hideharu

PY - 2018/8/6

Y1 - 2018/8/6

N2 - This paper aims at establishing a method for designing high-performance network topologies to bridge a gap between theoretical and practical studies. To this end, we present a novel graph called a host-switch graph, which consists of host vertices and switch vertices with maximum degree 1 and r, respectively. This graph represents a network topology of a practical parallel/distributed computer system with host computers connected by r-port switches. We discuss important metrics for designing high performance interconnection networks: the host-to-host average shortest path length (h-ASPL) and the bisection width (BiW). In particular, we explore a method for constructing host-switch graphs with low h-ASPL and high BiW that connect the fixed number of hosts via any number of r-port switches. We demonstrate that the number of switches that provides the minimum h-ASPL can mathematically be approximated, and the minimum number of switches that provides a certain BiW can experimentally be approximated. On the basis of the approximations, we propose a randomized algorithm for searching host-switch graphs. We then apply the graphs to interconnection networks and compare them with typical network topologies. As compared with the torus, the dragonfly, and the fat-tree, our networks attain higher performance and smaller power and costs.

AB - This paper aims at establishing a method for designing high-performance network topologies to bridge a gap between theoretical and practical studies. To this end, we present a novel graph called a host-switch graph, which consists of host vertices and switch vertices with maximum degree 1 and r, respectively. This graph represents a network topology of a practical parallel/distributed computer system with host computers connected by r-port switches. We discuss important metrics for designing high performance interconnection networks: the host-to-host average shortest path length (h-ASPL) and the bisection width (BiW). In particular, we explore a method for constructing host-switch graphs with low h-ASPL and high BiW that connect the fixed number of hosts via any number of r-port switches. We demonstrate that the number of switches that provides the minimum h-ASPL can mathematically be approximated, and the minimum number of switches that provides a certain BiW can experimentally be approximated. On the basis of the approximations, we propose a randomized algorithm for searching host-switch graphs. We then apply the graphs to interconnection networks and compare them with typical network topologies. As compared with the torus, the dragonfly, and the fat-tree, our networks attain higher performance and smaller power and costs.

KW - average shortest path length

KW - bisection width

KW - Computational modeling

KW - Graph theory

KW - interconnection network

KW - Multiprocessor interconnection

KW - Network topology

KW - Network topology

KW - optimization

KW - Switches

KW - Topology

KW - Upper bound

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

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

U2 - 10.1109/TPDS.2018.2864286

DO - 10.1109/TPDS.2018.2864286

M3 - Article

AN - SCOPUS:85051365099

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

ER -