id: 05107027
dt: j
an: 05107027
au: Saikia, Dilip K.; Sen, Ranjan K.
ti: Two Ranking Schemes for Efficient Computation on the Star Interconnection
    Network.
so: IEEE Transactions on Parallel and Distributed Systems 07, No.04, 321-327
    (1996).
py: 1996
pu: Institute of Electrical and Electronics Engineers (IEEE), New York, NY
la: EN
cc: 
ut: matrix multiplication.
ci: 
li: doi:10.1109/71.494627
ab: Summary: 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.
rv: