Abstract: The star interconnection network is generally considered as an attractive network architecture for parallel computing. The proposed parallel algorithm for the computation of fast Fourier transform takes advantage of the diversities of recursive decomposition of the star interconnection networks in order to reduce the communication time involved in data exchange between nodes. This method also helps to implement other parallel algorithms such as finding solutions of linear equations or matrix multiplication on the star interconnection networks.