Analysis of buffer arrangements in low and high dimensional networks

Research output: Contribution to journalArticle

Abstract

Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it into virtual channels. There have been few studies attempting to address this issue, however, these studies have so far resorted to simulation experiments and focused on deterministic routing algorithms. In this paper we use analytical performance models to investigate the optimal arrangement of the available buffer space into multiple virtual channels when adaptive routing is used in wormhole-switched k-ary n-cubes.

Original languageEnglish
Pages (from-to)80-90
Number of pages11
JournalJournal of Engineering Research
Volume7
Issue number2
Publication statusPublished - 2010

Fingerprint

Switching networks
Routing algorithms
Bandwidth
Experiments

Keywords

  • Finite buffers
  • Interconnection networks
  • Performance analysis
  • Virtual channels
  • Wormhole switching

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Analysis of buffer arrangements in low and high dimensional networks. / Alzeidi, N.

In: Journal of Engineering Research, Vol. 7, No. 2, 2010, p. 80-90.

Research output: Contribution to journalArticle

@article{32895c98b1c6460092d424813cd8481a,
title = "Analysis of buffer arrangements in low and high dimensional networks",
abstract = "Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it into virtual channels. There have been few studies attempting to address this issue, however, these studies have so far resorted to simulation experiments and focused on deterministic routing algorithms. In this paper we use analytical performance models to investigate the optimal arrangement of the available buffer space into multiple virtual channels when adaptive routing is used in wormhole-switched k-ary n-cubes.",
keywords = "Finite buffers, Interconnection networks, Performance analysis, Virtual channels, Wormhole switching",
author = "N. Alzeidi",
year = "2010",
language = "English",
volume = "7",
pages = "80--90",
journal = "Journal of Engineering Research",
issn = "1726-6009",
publisher = "Sultan Qaboos University",
number = "2",

}

TY - JOUR

T1 - Analysis of buffer arrangements in low and high dimensional networks

AU - Alzeidi, N.

PY - 2010

Y1 - 2010

N2 - Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it into virtual channels. There have been few studies attempting to address this issue, however, these studies have so far resorted to simulation experiments and focused on deterministic routing algorithms. In this paper we use analytical performance models to investigate the optimal arrangement of the available buffer space into multiple virtual channels when adaptive routing is used in wormhole-switched k-ary n-cubes.

AB - Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it into virtual channels. There have been few studies attempting to address this issue, however, these studies have so far resorted to simulation experiments and focused on deterministic routing algorithms. In this paper we use analytical performance models to investigate the optimal arrangement of the available buffer space into multiple virtual channels when adaptive routing is used in wormhole-switched k-ary n-cubes.

KW - Finite buffers

KW - Interconnection networks

KW - Performance analysis

KW - Virtual channels

KW - Wormhole switching

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

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

M3 - Article

VL - 7

SP - 80

EP - 90

JO - Journal of Engineering Research

JF - Journal of Engineering Research

SN - 1726-6009

IS - 2

ER -