A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Parallel sorting algorithms in hypercubes have been studied extensively. One of the practical parallel sorting algorithms is Bitonic Sort, which is implemented in O(n 2 ) time for sorting N = 2 n numbers in an n-cube. A versatile family of interconnection networks alternative to hypercube, called metacube, was proposed for building extremely large scale multiprocessor systems with a small number of links per node. A metacube MC(k, m) connects 2 2 k m+k nodes with only k + m links per node. Indoi:10.1007/978-3-642-03095-6_36 fatcat:oekyu63c25axpllvtit7gd2n3i