Latifi, S. and P.K. Srimani, "A new fixed degree regular network for parallel processing," Proc. IEEE Symp. Parallel and Distributed Processing, Oct. 1996, pp. 152-159. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Pancake Problems with Restricted Prefix Reversals and some.. - Bass, Sudborough (1998) (Correct)
....as good as any degree 3 network can have, at least to within a small constant factor. Triad n is maximally fault tolerant . The n dimensional star network [2] can be emulated by Triad n with linear slowdown . Both the n dimensional shuffle exchange [19] 25] and shuffle exchange permutation [18] networks can be emulated by Triad n with constant slowdown. We show that any set of generators consisting of a constant number of flips requires W(n log 2 n) to sort all permutations in S n . We also describe necessary conditions on sets of generators to sort all permutations in Q(n log 2 n) ....
....graphs have been extensively studied [1] 6] 16] as bases for interconnection networks, due to their many desirable properties, including regularity, vertex symmetry and recursive or near recursive substructure. Recently, a number of Cayley networks of degree O(1) have been proposed. 23] [18], 17] Some examples of fixed degree Cayley networks are shown in Table 1, with diameter results in [24] 7] and [17] 5 Network Introduced # Nodes Degree Diameter Trivalent Cayley Graph 1995 n2 n 3 2n 1 Shuffle Exchange Permutation Network 1996 n 3 QQ(n 2 ) Incomplete k ary n cube, ....
S. Latifi and P. K. Srimani. A new fixed degree regular network for parallel processing. In Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, pages 152159, Los Alamitos, California, October 1996.
On The Shuffle-Exchange Permutation Network - Douglas Bass And (1997) (Correct)
....network (SEP n ) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5 8)n 2 O(n) where n is the length of the permutation. This improves on a (9 8)n 2 routing algorithm described earlier [5]. Thus, the diameter of SEP n is at most (5 8) n 2 O(n) We also show that the diameter is at least n 2 2 O(n) We demonstrate that SEP n has a Hamilton cycle, for n t 3, left open in [5] and describe embeddings of variable degree Cayley networks, such as bubble sort networks [1] ....
....the length of the permutation. This improves on a (9 8)n 2 routing algorithm described earlier [5] Thus, the diameter of SEP n is at most (5 8) n 2 O(n) We also show that the diameter is at least n 2 2 O(n) We demonstrate that SEP n has a Hamilton cycle, for n t 3, left open in [5], and describe embeddings of variable degree Cayley networks, such as bubble sort networks [1] star networks [2] and pancake networks [4] into SEP n . Our embeddings for these networks are substantial improvements of earlier results stated in [5] Keywords: Cayley graphs, routing algorithms, ....
[Article contains additional citation context not shown here]
S. Latifi and P. K. Srimani. A new fixed degree regular network for parallel processing. In Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, pages 152-159, Los Alamitos, California, October 1996.
Parallel Algorithms on the Rotation-Exchange Network - A.. - Yeh, Varvarigos (Correct)
No context found.
Latifi, S. and P.K. Srimani, "A new fixed degree regular network for parallel processing," Proc. IEEE Symp. Parallel and Distributed Processing, Oct. 1996, pp. 152-159.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC