Increasing the adaptivity of routing algorithms for k-ary n-cubes

Author

Baydal, E. ; López, P. ; Duato, J.

Author_Institution

Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain

fYear

2002

fDate

2002

Firstpage

455

Lastpage

462

Abstract

In this paper, we show that routing algorithms may exploit not only the flexibility obtained by crossing network dimensions in any order but also that obtained in the same network dimension, thanks to the availability of bidirectional channels. We analyze the behavior of adaptive routing algorithms both for deadlock avoidance and recovery, exploiting this increased routing flexibility, and compare them with previous proposals in order to evaluate the contribution of the additional routing freedom on network performance. Simulation results show that this simple improvement in the routing algorithm allows one to achieve throughput improvements of up to 45% in networks with low radix, for a uniform distribution of message destinations

Keywords

adaptive systems; concurrency control; hypercube networks; network routing; parallel algorithms; performance evaluation; system recovery; adaptive routing algorithms; additional routing freedom; algorithm adaptivity; bidirectional channels; deadlock avoidance; deadlock recovery; hypercube networks; k-ary n-cubes; network dimension crossing; network performance; network radix; routing flexibility; simulation; throughput; uniform message destination distribution; wormhole switching; Algorithm design and analysis; Clustering algorithms; Computer networks; Cows; Electronic mail; Proposals; Routing; System recovery; Throughput; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel, Distributed and Network-based Processing, 2002. Proceedings. 10th Euromicro Workshop on

Conference_Location

Canary Islands

Print_ISBN

0-7695-1444-8

Type

conf

DOI

10.1109/EMPDP.2002.994333

Filename

994333