Issue No. 04 - April (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.494627
<p><b>Abstract</b>—A node ranking scheme provides the necessary structural view for developing algorithms on a network. We present two ranking schemes for the star interconnection network both of which allow constant time order preserving communication. The first scheme is based on a hierarchical view of the star network. It enables one to efficiently implement order preserving ASCEND/DESCEND class of algorithms. This class includes several important algorithms such as the Fast Fourier Transform (FFT) and matrix multiplication. The other ranking scheme gives a flexible pipelined view of the star interconnection network and provides a suitable framework for implementation of pipelined algorithms.</p>
Star interconnection network, parallel processing, ASCEND/DESCEND algorithm, pipelined algorithm, node ranking, order preserving communication, Fast Fourier Transform (FFT), matrix multiplication.
Ranjan K. Sen, Dilip K. Saikia, "Two Ranking Schemes for Efficient Computation on the Star Interconnection Network", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 321-327, April 1996, doi:10.1109/71.494627