MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  An Analytical Model of Adaptive Wormhole Routing with Time-out

Download:
Download as a PDF
by A. Khonsari, H. Sarbazi-azad, M. Ould-khaoua
http://www.comp.leeds.ac.uk/ukpew01/proceedings/khonsari.pdf
Add To MetaCart

Abstract:

Several studies have shown that the performance advantages of adaptive routing over deterministic routing are reduced when the traffic contains strong degree of communication locality. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato in [Dua94]. The main feature of this algorithm is the use of a time-out selection function for assigning virtual channels. This has the advantage of reducing virtual channels multiplexing to improve the network performance, especially, in the presence of communication locality. Simulation experiments reveal that the proposed model predicts message latency with a good degree of accuracy under different traffic conditions. 1

Citations

425 A Survey of Wormhole Routing Techniques in Direct Networks – Ni, McKinley - 1993
367 Virtual-Channel Flow Control – Dally - 1990
341 The SGI Origin: A ccNUMA highly scalable server – Laudon, Lenoski - 1997
261 Performance analysis of k-ary n-cube interconnection networks – Dally - 1990
246 Interconnection Networks: An Engineering Approach – Duato, Yalamanchili, et al. - 1997
162 Limits on Interconnection Network Performance – Agarwal - 1991
161 A new theory of deadlock-free adaptive routing in wormhole networks – Duato - 1993
67 Stochastic Modeling and Analysis: A Computational Approach – Tijms - 1986
48 The iPSC/2 direct-connect communications technology – Nugent - 1988
29 A comprehensive analytical model for wormhole routing in multicomputer systems – Draper, Ghosh - 1994
26 The message flow model for routing in wormhole-routed networks – Lin, Mckinley, et al. - 1993
22 Hypercube communication delay with wormhole routing – Kim, Das - 1994
19 Adaptive deadlock-free routing in multicomputers using only one extra virtual channel – Su, Shin - 1993
13 Improving the Efficiency of Virtual Channels With Time-Dependent Selection Functions – Duato - 1992
6 et al. The reliable router: A reliable and high-performance communication substrate for parallel computers – Dally - 1994
5 An accurate model for the performance analysis of deterministic wormhole routing – Ciciani, Colajanni, et al. - 1997
5 A performance model for Duato’s fully adaptive routing algorithm in k-ary n-cubes – Ould-Khaoua - 1999
5 Multicomputer networks: Message based parallel processing – Reed, Fujimoto - 1987
4 A performance model for adaptive routing – Boura, Das, et al. - 1994
4 General customer impatience in the queue GI/G/1 – Daley - 1965
4 A queueing model for wormhole routing with timeout – Hu, Kleinrock - 1995
3 Queueing Systems: Theory, vol.1 – Kleinrock - 1975
1 The M-Machine multicomputer, Int – Fillo, Keckler, et al. - 1997
1 Workload of an iPSC/860, Proc.Scalable High-Performance Computing Conf – Vanvoorst, Seidel, et al. - 1994