Efficient Algorithms for Some Common Applications on GHCC.

Generalized Hypercube-Connected-Cycles (GHCC), is a challenging interconnection network, proposed earlier in the literature. In this paper, we discuss how some important, useful algorithms, like, matrix transpose, matrix multiplication and sorting can efficiently be implemented on GHCC. Matrix transpose and matrix-by-matrix multiplication of matrices of order n × n, $n = m^{\frac{l}{2}}$, takes O(l) and $O(\frac{n \log_2 n}{l})$ time, respectively, on GHCC(l,m), with lml processors. Using the same number of processors, a list of ml numbers can be sorted in O(l2log3 m) time. [ABSTRACT FROM AUTHOR]