Parallel bucket sort algorithm on optical chained-cubic tree interconnection network

Abstract

Abstract The performance of sorting algorithms has a great impact on many computationally intensive applications. Researchers worked on parallelizing many sorting algorithms to improve their sequential counterpart performance. Thus, several interconnection networks have been presented for that purpose, such as tree and hypercube as basic interconnection networks and Chained-Cubic Tree (CCT) and Optical CCT (OCCT) as hybrid interconnection networks. The OCCT is constructed from a tree and hypercubes where optical links are added between hypercubes on a certain level of the tree. These optical links are used for long-distance and provide speed and low power consumption. In this paper, a new modified Parallel Bucket Sort (PBS) algorithm is presented and applied to the OCCT interconnection network. This PBS algorithm is evaluated analytically and by simulation in terms of various performance metrics including parallel runtime, computation time, communication time, concatenation time, speedup, and efficiency, for a different number of processors, dataset sizes, and data distributions including random and descending. Simulation results show that the highest obtained speedup is approximately 862 on OCCT using 1020 processors and descending input data distribution of size 40 MB. Also, the highest obtained efficiency is approximately 92% on OCCT using 124 processors and descending input data distribution of size 40 MB, which means the utilization of the OCCT processors reaches 92%.