Bitonic sort on a chained-cubic tree interconnection network
We map bitonic sort to a chained-cubic tree interconnection network, calling the result BSCCT. BSCCTs computation time is O((n/p)log(np)) O ( ( n / p )  log ( n p ) ) , for input size n n and p p processors. BSCCT costs O(plog2p) O ( p log 2 p ) communication steps, for input size n n and p p processors. BSCCTs relative speedup is 12-fold with p=1024 p = 1024 processors and n=32 n = 32 M keys. BSCCTs communication cost is less than the tree and metacube networks costs.
bitonic sort interconnection networks sorting and searching parallel algorithms performance evaluation