A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems

Draper, J.; Ghosh, Joydeep

doi:10.1006/jpdc.1994.1132

Cited by 211 publications

(133 citation statements)

References 18 publications

Supporting

Mentioning

133

Contrasting

Order By: Relevance

“…The model uses some widely used assumptions in the literature [12,16] to compute the average message latency of the unicast messages plus the specific assumptions regarding the broadcast messages.…”

Section: The Analysis Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Communication Model of Broadcast in Wormhole-Routed Networks on-Chip

Moadeli

Vanderbauwhede

2009

2009 International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

This paper presents a novel analytical model to compute communication latency of broadcast as the most fundamental collective communication operation. The novelty of the model lies in its ability to predict the broadcast communication latency in wormhole-routed architectures employing asynchronous multi-port routers scheme. The model is applied to the Quarc [17] NoC and its validity is verified by comparing the model predictions against the results obtained from a discrete-event simulator developed using OM-NET++.

show abstract

Section: The Analysis Methodsmentioning

confidence: 99%

“…The literature has witnessed numerous analytical performance model of the unicast traffic [12,16] and analysis of the unicast traffic in presence of the broadcast traffic [7] in parallel computers and NoC domains. In [18] Shahrabi et al introduced a model for computing broadcast communication latency in Hypercube.…”

Section: Introductionmentioning

confidence: 99%

A Communication Model of Broadcast in Wormhole-Routed Networks on-Chip

Moadeli

Vanderbauwhede

2009

2009 International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

show abstract

“…The model is based on the following assumptions that have been widely employed in similar networks analysis studies [4][5][6][7][8][9].…”

Section: Assumptionsmentioning

confidence: 99%

“…At each hope there is one cycle to transfer header flit over a channel, and some delay due to blocking in the network. Thus, the mean service time of a channel in dimension j, j T , can be expressed as T , following a suggestion proposed in [8], the variance of the service time can be approximated as 2 1 2 ) (…”

Section: Calculation Of the Mean Network Latency ( L )mentioning

confidence: 99%

A Performance Model of Fault-Tolerant Routing Algorithm in Interconnect Networks

Safaei

Khonsari

Ould‐Khaoua

2006

Computational Science – ICCS 2006

View full text Add to dashboard Cite

Abstract. The Software-Based fault-tolerant routing [1] has been proposed as an efficient routing algorithm to preserve both performance and fault-tolerant demands in large-scale parallel computers and current multiprocessor systemson-chip (Mp-SoCs). A number of different analytical models for fault-free routing algorithms have been suggested in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper presents a new analytical model to capture the effects of failures in wormhole-switched k-ary n-cubes using Software-Based fault-tolerant routing algorithm. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

show abstract

“…The model is based on the following assumptions that have been widely used in previous network modeling studies [4,6,13,17,18,21].…”

Section: Discussionmentioning

confidence: 99%