On Extensibilities of Interconnection Networks

Jywe Fei Fang; Yu Chin Liu; Chao Chin Wu; Hsun Wen Chang

On Extensibilities of Interconnection Networks

Jywe Fei Fang, Yu Chin Liu, Chao Chin Wu, Hsun Wen Chang

Department of Computer Science and Information Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

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

Original language	English
Pages	728-731
Number of pages	4
Publication status	Published - 2003 Nov 7
Event	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada Duration: 2003 Aug 28 → 2003 Aug 30

Other

Other	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
Country	Canada
City	Victoria, B.C.
Period	03-08-28 → 03-08-30

All Science Journal Classification (ASJC) codes

Signal Processing
Computer Networks and Communications

Access to Document

Fingerprint Dive into the research topics of 'On Extensibilities of Interconnection Networks'. Together they form a unique fingerprint.

Cite this

@conference{605987ecae7e45d08a6a9c9c4ba1e34d,

title = "On Extensibilities of Interconnection Networks",

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

author = "Fang, {Jywe Fei} and Liu, {Yu Chin} and Wu, {Chao Chin} and Chang, {Hsun Wen}",

year = "2003",

month = nov,

day = "7",

language = "English",

pages = "728--731",

note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

TY - CONF

T1 - On Extensibilities of Interconnection Networks

AU - Fang, Jywe Fei

AU - Liu, Yu Chin

AU - Wu, Chao Chin

AU - Chang, Hsun Wen

PY - 2003/11/7

Y1 - 2003/11/7

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

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

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

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

M3 - Paper

AN - SCOPUS:0142168879

SP - 728

EP - 731

T2 - 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)

Y2 - 28 August 2003 through 30 August 2003

ER -