Skip Navigation

The Computer Journal 2000 43(5):411-419; doi:10.1093/comjnl/43.5.411
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sarbazi-Azad, H.
Right arrow Articles by Mackenzie, L. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Message Latency in Hypercubes in the Presence of Matrix-Transpose Traffic

H. Sarbazi-Azad1, M. Ould-Khaoua1 and L. M. Mackenzie1

1 Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK Email: mohamed@dcs.gla.ac.uk

Several analytical models of adaptive routing in wormhole-routed networks, including hypercubes, under the uniform traffic pattern have recently been proposed in the literature. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns exhibited by many parallel applications. As a result, most existing studies have resorted to simulation when evaluating the performance merits of adaptive routing under non-uniform traffic conditions. This paper describes a new analytical model of adaptive routing in the hypercube in the presence of non-uniform traffic generated by matrix-transpose permutations, which is used in many matrix computation problems. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

Received 16 November, 1999. Revised 4 July, 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.