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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Networks and Communications
Cite this
}
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 conference › Paper
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 -