Efficient Algorithms for Some Common Applications on GHCC

作     者：Srabani Mukhopadhyaya Bhabani P. Sinha 

作者机构：Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata 700 108 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkaata 700 108 India 

出 版 物：《Journal of Interconnection Networks》 

年 卷 期：2005年第6卷第4期

页      面：417-433页

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Interconnection networks network topology degree diameter sorting matrix operations 

摘      要：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, , takes O(l) and time, respectively, on GHCC(l,m), with lm l processors. Using the same number of processors, a list of m l numbers can be sorted in O(l 2 log 3 m) time.