2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

Format:

Book

Author/Creator:

Institute of Electrical and Electronics Engineers, author.

Contributor:

IEEE Staff, Contributor.

Language:

English

Subjects (All):

Parallel processing (Electronic computers)--Congresses.

Parallel processing (Electronic computers).

Physical Description:

1 online resource (xx, 528 pages) : illustrations

Place of Publication:

[Place of publication not identified] I E E E 2010

Language Note:

English

Summary:

In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set disjoint-paths routing in metacube. Metacube is a cluster-based, hypercube-like interconnection network that can connect a huge number of nodes with small amount of links per node. An metacube MC(k,m) has 2^{2^kmk} nodes and mk links per node. For an MC(k,m) and two sets of nodes S and T of size mk, the algorithm finds mk disjoint paths, \node {s i\rightarrow \node {t j,~1\leq i,j \leq mk, \node{s i\in S, \node{t j\in T, in O((mk)(2^km)\log (mk)) time. The length of the paths is at most (m+1)2^k+(2k1)(\lceil \lg (mk)\rceil \lfloor \lg 2(mk)\rfloor 1) if (k=2 and m\geq 3) or (k=3 and m\geq 2) or (k>3). In other cases, the length of the paths is at most (k1)(m2^kmk).

Notes:

Bibliographic Level Mode of Issuance: Monograph

ISBN:

9780769542874

0769542875