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 language | English |
---|---|
Title of host publication | Proceedings of the International Conference on Parallel Processing |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 383-392 |
Number of pages | 10 |
Volume | 2001-January |
ISBN (Print) | 0769512577 |
DOIs | |
Publication status | Published - 2001 |
Event | International Conference on Parallel Processing, ICPP 2001 - Valencia, Spain Duration: 2001 Sept 3 → 2001 Sept 7 |
Other
Other | International Conference on Parallel Processing, ICPP 2001 |
---|---|
Country/Territory | Spain |
City | Valencia |
Period | 01/9/3 → 01/9/7 |
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