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

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

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

  • 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.