ORDER PRESERVING COMMUNICATION ON A STAR NETWORK

We present a scheme for ordering nodes in a star network such that it requires only a constant time for communication between a pair of node s of the same rank in different sub-stars. This enables us to implemen t order preserving ASCEND/DESCEND type of divide and conquer algorithm s such as the Fast Fourier Transform (FFT) efficiently on the star net work. We also present a scheme to model a star network as a pipeline o f sub-stars. This gives us a convenient framework for implementation o f pipelined computations on a star network.