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

50 Citations (Scopus)


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.
Number of pages10
ISBN (Print)0769512577
Publication statusPublished - 2001
EventInternational Conference on Parallel Processing, ICPP 2001 - Valencia, Spain
Duration: 2001 Sept 32001 Sept 7


OtherInternational Conference on Parallel Processing, ICPP 2001


  • 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


Dive into the research topics of 'L-turn routing: An adaptive routing in irregular networks'. Together they form a unique fingerprint.

Cite this