Communication delay in wormhole-switched Tori networks under bursty workloads

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Workloads generated by the real-world parallel applications that are executed on a multicomputer have a strong effect on the performance of its interconnection network - the hardware fabric supporting communication among individual processors. Existing multicomputer networks have been primarily designed and analysed under the assumption that the workload follows the non-bursty Poisson arrival process. As a step towards obtaining a clear understanding of network performance under various workloads, this paper presents a new analytical model for computing message latency in wormhole switched torus networks in the presence of bursty traffic, based on the well-known Markov-Modulated Poisson Process (MMPP). In order to derive the model, the approach for accurately capturing the properties of the composite MMPPs is applied to characterize traffic on network channels. Moreover, a general method has been proposed for calculating the probability of virtual channel occupancy when the traffic on network channels follows a multi-state MMPP process. Simulation experiments reveal that the model exhibits a good degree of accuracy.

Original languageEnglish
Pages (from-to)77-94
Number of pages18
JournalJournal of Supercomputing
Volume26
Issue number1
DOIs
Publication statusPublished - Aug 2003

Fingerprint

Wormhole
Communication Delay
Switching networks
Workload
Torus
Markov Modulated Poisson Process
Multicomputers
Communication
Traffic
Network performance
Analytical models
Virtual Channel
Hardware
Multi-state
Parallel Applications
Interconnection Networks
Composite materials
Network Performance
Real-world Applications
Analytical Model

Keywords

  • Interconnection networks
  • Message latency
  • Multicomputers
  • Multimedia applications
  • Performance modeling/analysis

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Communication delay in wormhole-switched Tori networks under bursty workloads. / Min, C.; Ould-Khaoua, M.

In: Journal of Supercomputing, Vol. 26, No. 1, 08.2003, p. 77-94.

Research output: Contribution to journalArticle

@article{389fe0bb7cc247c1a83921dd4e658afd,
title = "Communication delay in wormhole-switched Tori networks under bursty workloads",
abstract = "Workloads generated by the real-world parallel applications that are executed on a multicomputer have a strong effect on the performance of its interconnection network - the hardware fabric supporting communication among individual processors. Existing multicomputer networks have been primarily designed and analysed under the assumption that the workload follows the non-bursty Poisson arrival process. As a step towards obtaining a clear understanding of network performance under various workloads, this paper presents a new analytical model for computing message latency in wormhole switched torus networks in the presence of bursty traffic, based on the well-known Markov-Modulated Poisson Process (MMPP). In order to derive the model, the approach for accurately capturing the properties of the composite MMPPs is applied to characterize traffic on network channels. Moreover, a general method has been proposed for calculating the probability of virtual channel occupancy when the traffic on network channels follows a multi-state MMPP process. Simulation experiments reveal that the model exhibits a good degree of accuracy.",
keywords = "Interconnection networks, Message latency, Multicomputers, Multimedia applications, Performance modeling/analysis",
author = "C. Min and M. Ould-Khaoua",
year = "2003",
month = "8",
doi = "10.1023/A:1024468119020",
language = "English",
volume = "26",
pages = "77--94",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Communication delay in wormhole-switched Tori networks under bursty workloads

AU - Min, C.

AU - Ould-Khaoua, M.

PY - 2003/8

Y1 - 2003/8

N2 - Workloads generated by the real-world parallel applications that are executed on a multicomputer have a strong effect on the performance of its interconnection network - the hardware fabric supporting communication among individual processors. Existing multicomputer networks have been primarily designed and analysed under the assumption that the workload follows the non-bursty Poisson arrival process. As a step towards obtaining a clear understanding of network performance under various workloads, this paper presents a new analytical model for computing message latency in wormhole switched torus networks in the presence of bursty traffic, based on the well-known Markov-Modulated Poisson Process (MMPP). In order to derive the model, the approach for accurately capturing the properties of the composite MMPPs is applied to characterize traffic on network channels. Moreover, a general method has been proposed for calculating the probability of virtual channel occupancy when the traffic on network channels follows a multi-state MMPP process. Simulation experiments reveal that the model exhibits a good degree of accuracy.

AB - Workloads generated by the real-world parallel applications that are executed on a multicomputer have a strong effect on the performance of its interconnection network - the hardware fabric supporting communication among individual processors. Existing multicomputer networks have been primarily designed and analysed under the assumption that the workload follows the non-bursty Poisson arrival process. As a step towards obtaining a clear understanding of network performance under various workloads, this paper presents a new analytical model for computing message latency in wormhole switched torus networks in the presence of bursty traffic, based on the well-known Markov-Modulated Poisson Process (MMPP). In order to derive the model, the approach for accurately capturing the properties of the composite MMPPs is applied to characterize traffic on network channels. Moreover, a general method has been proposed for calculating the probability of virtual channel occupancy when the traffic on network channels follows a multi-state MMPP process. Simulation experiments reveal that the model exhibits a good degree of accuracy.

KW - Interconnection networks

KW - Message latency

KW - Multicomputers

KW - Multimedia applications

KW - Performance modeling/analysis

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

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

U2 - 10.1023/A:1024468119020

DO - 10.1023/A:1024468119020

M3 - Article

VL - 26

SP - 77

EP - 94

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 1

ER -