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 language | English |
|---|---|
| Pages (from-to) | 13-16 |
| Number of pages | 4 |
| Journal | Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division |
| Volume | 85 |
| Issue number | 1 MAY |
| Publication status | Published - 2004 May 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
Cite this
}
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 journal › Article
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 -