Modeling wormhole routing in a hypercube

Jong Kim, Chitaranjan Das

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

11 Citations (Scopus)

Abstract

An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture any message destination distribution. Next, the average message delay that consists of two parts is found. The analysis is extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Editors Anon
PublisherPubl by IEEE
Pages386-393
Number of pages8
ISBN (Print)0818621443
StatePublished - May 1 1991
EventProceedings of the 11th International Conference on Distributed Computing Systems - Arlington, TX, USA
Duration: May 20 1991May 24 1991

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

OtherProceedings of the 11th International Conference on Distributed Computing Systems
CityArlington, TX, USA
Period5/20/915/24/91

Fingerprint

Telecommunication traffic
Analytical models

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kim, J., & Das, C. (1991). Modeling wormhole routing in a hypercube. In Anon (Ed.), Proceedings - International Conference on Distributed Computing Systems (pp. 386-393). (Proceedings - International Conference on Distributed Computing Systems). Publ by IEEE.
Kim, Jong ; Das, Chitaranjan. / Modeling wormhole routing in a hypercube. Proceedings - International Conference on Distributed Computing Systems. editor / Anon. Publ by IEEE, 1991. pp. 386-393 (Proceedings - International Conference on Distributed Computing Systems).
@inproceedings{cdd43ea7338a4964868dccb3c3a20bdc,
title = "Modeling wormhole routing in a hypercube",
abstract = "An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture any message destination distribution. Next, the average message delay that consists of two parts is found. The analysis is extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated.",
author = "Jong Kim and Chitaranjan Das",
year = "1991",
month = "5",
day = "1",
language = "English (US)",
isbn = "0818621443",
series = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "Publ by IEEE",
pages = "386--393",
editor = "Anon",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",

}

Kim, J & Das, C 1991, Modeling wormhole routing in a hypercube. in Anon (ed.), Proceedings - International Conference on Distributed Computing Systems. Proceedings - International Conference on Distributed Computing Systems, Publ by IEEE, pp. 386-393, Proceedings of the 11th International Conference on Distributed Computing Systems, Arlington, TX, USA, 5/20/91.

Modeling wormhole routing in a hypercube. / Kim, Jong; Das, Chitaranjan.

Proceedings - International Conference on Distributed Computing Systems. ed. / Anon. Publ by IEEE, 1991. p. 386-393 (Proceedings - International Conference on Distributed Computing Systems).

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

TY - GEN

T1 - Modeling wormhole routing in a hypercube

AU - Kim, Jong

AU - Das, Chitaranjan

PY - 1991/5/1

Y1 - 1991/5/1

N2 - An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture any message destination distribution. Next, the average message delay that consists of two parts is found. The analysis is extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated.

AB - An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture any message destination distribution. Next, the average message delay that consists of two parts is found. The analysis is extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated.

UR - http://www.scopus.com/inward/record.url?scp=0026159366&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026159366&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026159366

SN - 0818621443

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 386

EP - 393

BT - Proceedings - International Conference on Distributed Computing Systems

A2 - Anon, null

PB - Publ by IEEE

ER -

Kim J, Das C. Modeling wormhole routing in a hypercube. In Anon, editor, Proceedings - International Conference on Distributed Computing Systems. Publ by IEEE. 1991. p. 386-393. (Proceedings - International Conference on Distributed Computing Systems).