On extensibilities of interconnection networks

Y. C. Liu, J. F. Fang, Chao-Chin Wu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Researchers have used nodes number to measure the extensibility of a topology. However, this metric is not very evident. In this paper, a specific metric called extensible density to measure the extensibilities of interconnection networks is introduced. Some topologies have high degree of extensibilities, but efficient parallel algorithms can apply only on a special subclass of these topologies. Furthermore, the concept of density to measure the applicable extent of parallel algorithms have been extended.

Original languageEnglish
Pages (from-to)13-16
Number of pages4
JournalJournal of the Institution of Engineers (India), Part CP: Computer Engineering Division
Volume85
Issue number1 MAY
Publication statusPublished - 2004 May 1

Fingerprint

Topology
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{1f3301b1850b47aea7bd9bf43274b6be,
title = "On extensibilities of interconnection networks",
abstract = "Researchers have used nodes number to measure the extensibility of a topology. However, this metric is not very evident. In this paper, a specific metric called extensible density to measure the extensibilities of interconnection networks is introduced. Some topologies have high degree of extensibilities, but efficient parallel algorithms can apply only on a special subclass of these topologies. Furthermore, the concept of density to measure the applicable extent of parallel algorithms have been extended.",
author = "Liu, {Y. C.} and Fang, {J. F.} and Chao-Chin Wu",
year = "2004",
month = "5",
day = "1",
language = "English",
volume = "85",
pages = "13--16",
journal = "Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division",
issn = "0971-0469",
publisher = "Institution of Engineers (India)",
number = "1 MAY",

}

On extensibilities of interconnection networks. / Liu, Y. C.; Fang, J. F.; Wu, Chao-Chin.

In: Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division, Vol. 85, No. 1 MAY, 01.05.2004, p. 13-16.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On extensibilities of interconnection networks

AU - Liu, Y. C.

AU - Fang, J. F.

AU - Wu, Chao-Chin

PY - 2004/5/1

Y1 - 2004/5/1

N2 - Researchers have used nodes number to measure the extensibility of a topology. However, this metric is not very evident. In this paper, a specific metric called extensible density to measure the extensibilities of interconnection networks is introduced. Some topologies have high degree of extensibilities, but efficient parallel algorithms can apply only on a special subclass of these topologies. Furthermore, the concept of density to measure the applicable extent of parallel algorithms have been extended.

AB - Researchers have used nodes number to measure the extensibility of a topology. However, this metric is not very evident. In this paper, a specific metric called extensible density to measure the extensibilities of interconnection networks is introduced. Some topologies have high degree of extensibilities, but efficient parallel algorithms can apply only on a special subclass of these topologies. Furthermore, the concept of density to measure the applicable extent of parallel algorithms have been extended.

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

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

M3 - Article

AN - SCOPUS:30444439233

VL - 85

SP - 13

EP - 16

JO - Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division

JF - Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division

SN - 0971-0469

IS - 1 MAY

ER -