A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic

H. Sarbazi-Azad, L. M. Mackenzie, M. Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages345-352
Number of pages8
Volume2000-January
ISBN (Print)0769507689
DOIs
Publication statusPublished - 2000
EventInternational Conference on Parallel Processing, ICPP 2000 - Toronto, Canada
Duration: Aug 21 2000Aug 24 2000

Other

OtherInternational Conference on Parallel Processing, ICPP 2000
CountryCanada
CityToronto
Period8/21/008/24/00

Keywords

  • Analytical models
  • Bandwidth
  • Computational modeling
  • Computer science
  • Delay
  • Predictive models
  • Routing
  • System recovery
  • Telecommunication traffic
  • Traffic control

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic'. Together they form a unique fingerprint.

  • Cite this

    Sarbazi-Azad, H., Mackenzie, L. M., & Ould-Khaoua, M. (2000). A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic. In Proceedings of the International Conference on Parallel Processing (Vol. 2000-January, pp. 345-352). [876150] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2000.876150