MMLRU selection function

A simple and efficient output selection function in adaptive routing

Michihiro Koibuchi, Akiya Jouraku, Hideharu Amano

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.

Original languageEnglish
Pages (from-to)109-118
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE88-D
Issue number1
DOIs
Publication statusPublished - 2005 Jan

Fingerprint

Routing algorithms
Adaptive algorithms
Routers
Throughput
Topology

Keywords

  • Adaptive routing
  • Interconnection networks
  • Massively parallel computers
  • Output selection function
  • Virtual channel

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

MMLRU selection function : A simple and efficient output selection function in adaptive routing. / Koibuchi, Michihiro; Jouraku, Akiya; Amano, Hideharu.

In: IEICE Transactions on Information and Systems, Vol. E88-D, No. 1, 01.2005, p. 109-118.

Research output: Contribution to journalArticle

@article{41749802c48b4d8c9aaf73526c58d2e9,
title = "MMLRU selection function: A simple and efficient output selection function in adaptive routing",
abstract = "Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.",
keywords = "Adaptive routing, Interconnection networks, Massively parallel computers, Output selection function, Virtual channel",
author = "Michihiro Koibuchi and Akiya Jouraku and Hideharu Amano",
year = "2005",
month = "1",
doi = "10.1093/ietisy/E88-D.1.109",
language = "English",
volume = "E88-D",
pages = "109--118",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - MMLRU selection function

T2 - A simple and efficient output selection function in adaptive routing

AU - Koibuchi, Michihiro

AU - Jouraku, Akiya

AU - Amano, Hideharu

PY - 2005/1

Y1 - 2005/1

N2 - Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.

AB - Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.

KW - Adaptive routing

KW - Interconnection networks

KW - Massively parallel computers

KW - Output selection function

KW - Virtual channel

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

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

U2 - 10.1093/ietisy/E88-D.1.109

DO - 10.1093/ietisy/E88-D.1.109

M3 - Article

VL - E88-D

SP - 109

EP - 118

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 1

ER -