On extensibilities of interconnection networks

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.