Skip to main navigation Skip to search Skip to main content

Preliminary research of a novel routing algorithm cross-line using dynamic information

  • Masashi Nishitani
  • , Satoshi Ezura
  • , Takashi Yokota
  • , Fumihito Furukawa
  • , Kanemitsu Ootsu
  • , Takanobu Baba
  • Utsunomiya University

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

Routing methods for interconnection networks affect the performance of parallel computers considerably. Thus they have been studied and many methods are proposed and implemented. Advances in VLSI integration, network band-width, and processor performance. However, drive us to consider novel routing methods. In this paper, we propose a novel adaptive routing algorithm, called "Cross-Line." This routing algorithm has a unique feature of using dynamic information. We have developed an interconnection networks simulation framework, called "Chimera," so that we can evaluate the Cross-Line method quantitatively.

Original languageEnglish
Article number439-077
Pages (from-to)107-112
Number of pages6
JournalProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Volume16
StatePublished - 2004
Externally publishedYes
EventProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: 9 Nov 200411 Nov 2004

Keywords

  • Adaptive routing algorithm
  • Dynamic information
  • Interconnection networks
  • Network simulator

Fingerprint

Dive into the research topics of 'Preliminary research of a novel routing algorithm cross-line using dynamic information'. Together they form a unique fingerprint.

Cite this