A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes

A. Khonsari, H. Sarbazi-Azad, M. Ould-Khaoua

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)153-168
Number of pages16
JournalParallel Processing Letters
Volume15
Issue number1-2
DOIs
Publication statusPublished - Mar 2005

    Fingerprint

Keywords

  • M/G/1 queues
  • Performance modelling
  • Wormhole switching

ASJC Scopus subject areas

  • Computer Science(all)

Cite this