On extensibilities of interconnection networks

Y. C. Liu, J. F. Fang, Chao-Chin Wu

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)13-16
頁數4
期刊Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division
85
發行號1 MAY
出版狀態Published - 2004 五月 1

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

指紋 深入研究「On extensibilities of interconnection networks」主題。共同形成了獨特的指紋。

引用此