Performance analysis of k-ary n-cubes with fully adaptive routing

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

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

1 Citation (Scopus)

Abstract

Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.

Original languageEnglish
Title of host publicationProceedings - 7th International Conference on Parallel and Distributed Systems
Subtitle of host publicationWorkshops
EditorsYoshitaka Shibata
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages249-255
Number of pages7
ISBN (Electronic)0769505716, 9780769505718
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event7th International Conference on Parallel and Distributed Systems, ICPADS 2000 - Iwate, Japan
Duration: Jul 4 2000Jul 7 2000

Publication series

NameProceedings - 7th International Conference on Parallel and Distributed Systems: Workshops

Conference

Conference7th International Conference on Parallel and Distributed Systems, ICPADS 2000
Country/TerritoryJapan
CityIwate
Period7/4/007/7/00

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this