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
Liu, Y. C., Fang, J. F., & Wu, C-C. (2004). On extensibilities of interconnection networks. Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division, 85(1 MAY), 13-16.