On Extensibilities of Interconnection Networks

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

Research output: Contribution to conferencePaper

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 languageEnglish
Pages728-731
Number of pages4
Publication statusPublished - 2003 Nov 7
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: 2003 Aug 282003 Aug 30

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period03-08-2803-08-30

Fingerprint

Topology
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Fang, J. F., Liu, Y. C., Wu, C. C., & Chang, H. W. (2003). On Extensibilities of Interconnection Networks. 728-731. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.
Fang, Jywe Fei ; Liu, Yu Chin ; Wu, Chao Chin ; Chang, Hsun Wen. / On Extensibilities of Interconnection Networks. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.4 p.
@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 = "11",
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",

}

Fang, JF, Liu, YC, Wu, CC & Chang, HW 2003, 'On Extensibilities of Interconnection Networks', Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada, 03-08-28 - 03-08-30 pp. 728-731.

On Extensibilities of Interconnection Networks. / Fang, Jywe Fei; Liu, Yu Chin; Wu, Chao Chin; Chang, Hsun Wen.

2003. 728-731 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Research output: Contribution to conferencePaper

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

ER -

Fang JF, Liu YC, Wu CC, Chang HW. On Extensibilities of Interconnection Networks. 2003. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.