A constant queue partial permutation routing algorithm for cube-connected-cycles multicomputer systems

Gene Eu Jan, Ming Bo Lin, Albert Chao, Deron Liang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A general routing paradigm is considered and then applied to the routing and partial permutation routing problems on CCC(n, 2n) networks. The major idea of the general routing paradigm is based on the binary radix sorting scheme in which each bit of keys (i.e., destination addresses) from MSB is separated in sequence until the LSB is reached. The result is a sorted sequence. Based on this scheme, the partial permutation routing problem on CCC(n, 2n) networks can be solved in O(n2) time with O(1) buffers for each node, where n is the dimension of CCC(n, 2n) networks.

Original languageEnglish
Title of host publicationProceedings - 7th International Conference on Parallel and Distributed Systems
Subtitle of host publicationWorkshops
EditorsYoshitaka Shibata
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages35-40
Number of pages6
ISBN (Electronic)0769505716, 9780769505718
DOIs
StatePublished - 2000
Event7th International Conference on Parallel and Distributed Systems, ICPADS 2000 - Iwate, Japan
Duration: 4 Jul 20007 Jul 2000

Publication series

NameProceedings - 7th International Conference on Parallel and Distributed Systems: Workshops

Conference

Conference7th International Conference on Parallel and Distributed Systems, ICPADS 2000
Country/TerritoryJapan
CityIwate
Period4/07/007/07/00

Fingerprint

Dive into the research topics of 'A constant queue partial permutation routing algorithm for cube-connected-cycles multicomputer systems'. Together they form a unique fingerprint.

Cite this