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.
|頁（從 - 到）||13-16|
|期刊||Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division|
|出版狀態||Published - 2004 五月 1|
All Science Journal Classification (ASJC) codes
- Computer Science(all)