A novel channel assignment method to ensure deadlock-freedom for deterministic routing

Ryuta Kawano, Hiroshi Nakahara, Seiichi Tade, Ikki Fujiwara, Hiroki Matsutani, Michihiro Koibuchi, Hideharu Amano

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63% when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|-log |N|), when compared with another conventional algorithm that requires almost the same number of VCs.

Original languageEnglish
Pages (from-to)1798-1806
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE100D
Issue number8
DOIs
Publication statusPublished - 2017 Aug 1

Fingerprint

Scalability
Switches
Topology
Data storage equipment

Keywords

  • Deadlock-free routing
  • High performance computing
  • Time complexity

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

A novel channel assignment method to ensure deadlock-freedom for deterministic routing. / Kawano, Ryuta; Nakahara, Hiroshi; Tade, Seiichi; Fujiwara, Ikki; Matsutani, Hiroki; Koibuchi, Michihiro; Amano, Hideharu.

In: IEICE Transactions on Information and Systems, Vol. E100D, No. 8, 01.08.2017, p. 1798-1806.

Research output: Contribution to journalArticle

Kawano, Ryuta ; Nakahara, Hiroshi ; Tade, Seiichi ; Fujiwara, Ikki ; Matsutani, Hiroki ; Koibuchi, Michihiro ; Amano, Hideharu. / A novel channel assignment method to ensure deadlock-freedom for deterministic routing. In: IEICE Transactions on Information and Systems. 2017 ; Vol. E100D, No. 8. pp. 1798-1806.
@article{f56f20dd3969469ca277c66ebd4ebd40,
title = "A novel channel assignment method to ensure deadlock-freedom for deterministic routing",
abstract = "Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63{\%} when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|-log |N|), when compared with another conventional algorithm that requires almost the same number of VCs.",
keywords = "Deadlock-free routing, High performance computing, Time complexity",
author = "Ryuta Kawano and Hiroshi Nakahara and Seiichi Tade and Ikki Fujiwara and Hiroki Matsutani and Michihiro Koibuchi and Hideharu Amano",
year = "2017",
month = "8",
day = "1",
doi = "10.1587/transinf.2016EDP7477",
language = "English",
volume = "E100D",
pages = "1798--1806",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - A novel channel assignment method to ensure deadlock-freedom for deterministic routing

AU - Kawano, Ryuta

AU - Nakahara, Hiroshi

AU - Tade, Seiichi

AU - Fujiwara, Ikki

AU - Matsutani, Hiroki

AU - Koibuchi, Michihiro

AU - Amano, Hideharu

PY - 2017/8/1

Y1 - 2017/8/1

N2 - Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63% when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|-log |N|), when compared with another conventional algorithm that requires almost the same number of VCs.

AB - Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63% when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|-log |N|), when compared with another conventional algorithm that requires almost the same number of VCs.

KW - Deadlock-free routing

KW - High performance computing

KW - Time complexity

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

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

U2 - 10.1587/transinf.2016EDP7477

DO - 10.1587/transinf.2016EDP7477

M3 - Article

VL - E100D

SP - 1798

EP - 1806

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 8

ER -