Presentation 2001/4/6
Adaptive routing on irregular networks
Yuki Igawa, Akira Funahashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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 and virtual channels are considerably restricted in order to avoid deadlocks. In this paper, we propose a novel routing algorithm called Z-routing, which has an enough freedom in irregular networks by building a specific spanning tree and using two virtual channels. Simulation results show that Z-routing improves the performance compared with the traditional routing algorithms using two virtual channels.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) irregular network / adaptive routing / NOWs / PC cluster / deadlock avoidance
Paper # CPSY2001-1,FTS2001-1
Date of Issue

Conference Information
Committee CPSY
Conference Date 2001/4/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Computer Systems (CPSY)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Adaptive routing on irregular networks
Sub Title (in English)
Keyword(1) irregular network
Keyword(2) adaptive routing
Keyword(3) NOWs
Keyword(4) PC cluster
Keyword(5) deadlock avoidance
1st Author's Name Yuki Igawa
1st Author's Affiliation Department of Information Technology, Mie University()
2nd Author's Name Akira Funahashi
2nd Author's Affiliation Department of Information Technology, Mie University
Date 2001/4/6
Paper # CPSY2001-1,FTS2001-1
Volume (vol) vol.101
Number (no) 2
Page pp.pp.-
#Pages 8
Date of Issue