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

Author

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

Author_Institution

Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Taiwan

fYear

2000

fDate

36800

Firstpage

35

Lastpage

40

Abstract

A general routing paradigm is considered and then applied to the routing and partial permutation routing problems on CCC(n, 2ⁿ) 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, 2ⁿ) networks can be solved in O(n²) time with O(1) buffers for each node, where n is the dimension of CCC(n, 2ⁿ) networks

Keywords

computational complexity; hypercube networks; network routing; binary radix sorting scheme; buffers; constant queue partial permutation routing algorithm; cube-connected-cycle multicomputer systems; sorted sequence; Chaotic communication; Computer networks; Electronic mail; Hypercubes; Information science; Oceans; Random access memory; Read-write memory; Routing; Sorting;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000

Conference_Location

Iwate

Print_ISBN

0-7695-0571-6

Type

conf

DOI

10.1109/PADSW.2000.884512

Filename

884512