IEICE TRANSACTIONS on Information
MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.1 pp.109-118
- Publication Date
- 2005/01/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.1.109
- Type of Manuscript
- PAPER
- Category
- Computer Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Michihiro KOIBUCHI, Akiya JOURAKU, Hideharu AMANO, "MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 1, pp. 109-118, January 2005, doi: 10.1093/ietisy/e88-d.1.109.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.1.109/_p
Copy
@ARTICLE{e88-d_1_109,
author={Michihiro KOIBUCHI, Akiya JOURAKU, Hideharu AMANO, },
journal={IEICE TRANSACTIONS on Information},
title={MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing},
year={2005},
volume={E88-D},
number={1},
pages={109-118},
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={},
doi={10.1093/ietisy/e88-d.1.109},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing
T2 - IEICE TRANSACTIONS on Information
SP - 109
EP - 118
AU - Michihiro KOIBUCHI
AU - Akiya JOURAKU
AU - Hideharu AMANO
PY - 2005
DO - 10.1093/ietisy/e88-d.1.109
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2005
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.
ER -
English
