{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:46:29Z","timestamp":1649159189279},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2005,12]]},"abstract":" 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 \u00d7 n, [Formula: see text], takes O(l) and [Formula: see text] time, respectively, on GHCC(l,m), with lml<\/jats:sup> processors. Using the same number of processors, a list of ml<\/jats:sup> numbers can be sorted in O(l2<\/jats:sup> log 3<\/jats:sup> m) time. <\/jats:p>","DOI":"10.1142\/s0219265905001502","type":"journal-article","created":{"date-parts":[[2006,1,6]],"date-time":"2006-01-06T11:44:29Z","timestamp":1136547869000},"page":"417-433","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Some Common Applications on GHCC"],"prefix":"10.1142","volume":"06","author":[{"given":"Srabani","family":"Mukhopadhyaya","sequence":"first","affiliation":[{"name":"Advanced Computing and Microelectronics Unit, Indian Statistical Institute, 203, B. T. Road, Kolkata 700 108, India"}]},{"given":"Bhabani P.","family":"Sinha","sequence":"additional","affiliation":[{"name":"Advanced Computing and Microelectronics Unit, Indian Statistical Institute, 203, B. T. Road, Kolkaata 700 108, India"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","volume-title":"The Design and Analysis of Parallel Algorithms","author":"Akl S. G.","year":"1989"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009478"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/71.159046"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/12.628397"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.5009385"},{"key":"rf11","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1993"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1030"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7532"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/12.16500"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265905001502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:32:41Z","timestamp":1565148761000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265905001502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0219265905001502"],"URL":"https:\/\/doi.org\/10.1142\/s0219265905001502","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}