L-turn routing: An adaptive routing in irregular networks

M. Koibuchi, Akira Funahashi, A. Jouraku, Hideharu Amano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

47 Citations (Scopus)

Abstract

Network-based parallel processing using commodity personal computers has been widely developed. Since such systems require high degree of flexibility and scalability of wiring, a high-speed network with an irregular topology is often needed. In traditional routing algorithms for irregular networks, available paths are considerably restricted in order to avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn routing (L-turn routing), which makes a better traffic balancing in irregular networks by building a specific spanning tree. Result of simulations shows that L-turn routing achieves better performance than traditional ones with each topology.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages383-392
Number of pages10
Volume2001-January
ISBN (Print)0769512577
DOIs
Publication statusPublished - 2001
EventInternational Conference on Parallel Processing, ICPP 2001 - Valencia, Spain
Duration: 2001 Sep 32001 Sep 7

Other

OtherInternational Conference on Parallel Processing, ICPP 2001
CountrySpain
CityValencia
Period01/9/301/9/7

Fingerprint

Adaptive Routing
Routing algorithms
Irregular
Routing
Topology
Routing Algorithm
HIgh speed networks
Electric wiring
Personal computers
Scalability
High-speed Networks
Personal Computer
Deadlock
Parallel Processing
Spanning tree
Balancing
Processing
Flexibility
Traffic
Path

Keywords

  • High-speed networks
  • Microcomputers
  • Network topology
  • Parallel processing
  • Routing
  • Scalability
  • System recovery
  • Telecommunication traffic
  • Traffic control
  • Wiring

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Koibuchi, M., Funahashi, A., Jouraku, A., & Amano, H. (2001). L-turn routing: An adaptive routing in irregular networks. In Proceedings of the International Conference on Parallel Processing (Vol. 2001-January, pp. 383-392). [952084] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2001.952084

L-turn routing : An adaptive routing in irregular networks. / Koibuchi, M.; Funahashi, Akira; Jouraku, A.; Amano, Hideharu.

Proceedings of the International Conference on Parallel Processing. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. p. 383-392 952084.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koibuchi, M, Funahashi, A, Jouraku, A & Amano, H 2001, L-turn routing: An adaptive routing in irregular networks. in Proceedings of the International Conference on Parallel Processing. vol. 2001-January, 952084, Institute of Electrical and Electronics Engineers Inc., pp. 383-392, International Conference on Parallel Processing, ICPP 2001, Valencia, Spain, 01/9/3. https://doi.org/10.1109/ICPP.2001.952084
Koibuchi M, Funahashi A, Jouraku A, Amano H. L-turn routing: An adaptive routing in irregular networks. In Proceedings of the International Conference on Parallel Processing. Vol. 2001-January. Institute of Electrical and Electronics Engineers Inc. 2001. p. 383-392. 952084 https://doi.org/10.1109/ICPP.2001.952084
Koibuchi, M. ; Funahashi, Akira ; Jouraku, A. ; Amano, Hideharu. / L-turn routing : An adaptive routing in irregular networks. Proceedings of the International Conference on Parallel Processing. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. pp. 383-392
@inproceedings{b9f0788c8c78465ca1dacbd5546d539c,
title = "L-turn routing: An adaptive routing in irregular networks",
abstract = "Network-based parallel processing using commodity personal computers has been widely developed. Since such systems require high degree of flexibility and scalability of wiring, a high-speed network with an irregular topology is often needed. In traditional routing algorithms for irregular networks, available paths are considerably restricted in order to avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn routing (L-turn routing), which makes a better traffic balancing in irregular networks by building a specific spanning tree. Result of simulations shows that L-turn routing achieves better performance than traditional ones with each topology.",
keywords = "High-speed networks, Microcomputers, Network topology, Parallel processing, Routing, Scalability, System recovery, Telecommunication traffic, Traffic control, Wiring",
author = "M. Koibuchi and Akira Funahashi and A. Jouraku and Hideharu Amano",
year = "2001",
doi = "10.1109/ICPP.2001.952084",
language = "English",
isbn = "0769512577",
volume = "2001-January",
pages = "383--392",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - L-turn routing

T2 - An adaptive routing in irregular networks

AU - Koibuchi, M.

AU - Funahashi, Akira

AU - Jouraku, A.

AU - Amano, Hideharu

PY - 2001

Y1 - 2001

N2 - Network-based parallel processing using commodity personal computers has been widely developed. Since such systems require high degree of flexibility and scalability of wiring, a high-speed network with an irregular topology is often needed. In traditional routing algorithms for irregular networks, available paths are considerably restricted in order to avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn routing (L-turn routing), which makes a better traffic balancing in irregular networks by building a specific spanning tree. Result of simulations shows that L-turn routing achieves better performance than traditional ones with each topology.

AB - Network-based parallel processing using commodity personal computers has been widely developed. Since such systems require high degree of flexibility and scalability of wiring, a high-speed network with an irregular topology is often needed. In traditional routing algorithms for irregular networks, available paths are considerably restricted in order to avoid deadlocks. In this paper we propose a novel routing algorithm called left-up-first turn routing (L-turn routing), which makes a better traffic balancing in irregular networks by building a specific spanning tree. Result of simulations shows that L-turn routing achieves better performance than traditional ones with each topology.

KW - High-speed networks

KW - Microcomputers

KW - Network topology

KW - Parallel processing

KW - Routing

KW - Scalability

KW - System recovery

KW - Telecommunication traffic

KW - Traffic control

KW - Wiring

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

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

U2 - 10.1109/ICPP.2001.952084

DO - 10.1109/ICPP.2001.952084

M3 - Conference contribution

AN - SCOPUS:84951165359

SN - 0769512577

VL - 2001-January

SP - 383

EP - 392

BT - Proceedings of the International Conference on Parallel Processing

PB - Institute of Electrical and Electronics Engineers Inc.

ER -