C.S. Raghavendra and V.P. Kumar. Permutations on Illiac IV-type networks. IEEE Transactions on Computers, C-35(7):662--669, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... or can be determined at compile time [6, 9] The permutation capability is an important measure that indicates how efficient a network is in supporting static or compiled communications, and a large body of research efforts has been devoted to the subject in the past in either packetswitched [10, 16, 21, 29] or circuit switched [8, 27, 30] non multiplexed networks. One of our main contributions is the determination of the minimummultiplexing degree needed in LM and in PM, respectively, for a network to be rearrangeably nonblocking, that is, to be able to embed any permutation off line. We obtain ....

C.S. Raghavendra and V.P. Kumar. Permutations on Illiac IV-type networks. IEEE Transactions on Computers, C-35(7):662--669, 1986.

....is allowed, better results can be achieved. For example, with O(log 2 N) preprocessing time, optimal routes can be found for the class of permutations that can be specified by permuting and complementing the bits in the PE ID [27] for meshes with no wraparound. Raghavendra and Prassana Kumar [30] give algorithms to route various permutations optimally in meshes with wraparound, and also prove that there exist offline algorithms to route any permutation in 3n steps. One such algorithm was developed by Annexstein and Baumslag [2] Cut through and Worm hole Routing In the next section we ....

Raghavendra, C.S., and Prasanna Kumar, V.K., Permutations on Illiac IV-Type Networks. IEEE Trans. on Comp. C-35, 7 (Jul. 1986), 662-669.

....k O(1) if k = O(n ) for some constant 1. In practice k is usually small and hence it may be safe to assume this queue length to be k O(1) We also show that our routing and sorting algorithms apply to higher dimensional meshes. Several algorithms exist for off line routing (see e.g. [2, 7, 18, 20]) In [13] Leighton analyzes the expected behavior of certain greedy algorithms for packet routing. For an excellent treatise on sorting and routing algorithms for the mesh, the reader is referred to Leighton [14] Since kn 2 is a lower bound for all the three problems we consider in this paper ....

C.S. Raghavendra, and V.K.P. Kumar, Permutations on Illiac IV-Type Networks, IEEE Trans. Comp., C-35, 1986, pp. 662-669.

....PE after phase 1. Thus, to accomplish this transformation, we resort to the general method of performing an arbitrary permutation. It is well known that by mapping a 3 stage Clos network [Clos] onto an array processor, an arbitrary permutation can be performed using the following 3 phase algorithm [Ragh]. 1. Permute the elements within their rows so as to avoid congestion in phase 2. 2. Permute the elements along columns to get them to their destination rows. 3. Permute the elements within their destination rows to get them to their final positions. For the above routing scheme to be able to ....

C. S. Raghavendra and V. K. Prasanna Kumar, "Permutations on ILLIAC-IV Type Networks", IEEE Transactions on Computers, vol.c37, No.7, pp. 662-669, July 1986.

.... of a column have the same destination row, they will all end up in the same module) To avoid this kind of congestion, the elements are first permuted within their rows in such a manner that when the permutations along the columns are carried out, no two elements end up in the same module [RK86] The three phase routing method can therefore be described as follows: Phase I : Permute the elements within their rows so as to avoid congestion in Phase II. Phase II : Permute the elements within columns so as to get them to their destination rows. Phase III : Permute the elements within ....

C. S. Raghavendra and V. K. Prasanna Kumar. Permutations on ILLIAC-IV Type Networks. IEEE Transactions on Computers, C-37(7):622--629, July 1986.

No context found.

C. S. Raghavendra and V. K. Prasanna Kumar. Permutations on illiac iv-type networks. IEEE Transactions on Computers, pages 662--669, July 1986.

No context found.

C. S. Raghavendra and V. K. Prasanna Kumar. Permutations on illiac iv-type networks. IEEE Transactions on Computers, pages 662--669, July 1986.

.... of a column have the same destination row, they will all end up in the same register) To avoid this kind of congestion, the elements are first permuted within their rows in such a manner that when the permutations along the columns are carried out, no two elements end up in the same register [30]. The three phase routing method can therefore be described as follows: Phase I : Permute the elements within their rows so as to avoid congestion in Phase II. Phase II : Permute the elements within columns so as to get them to their destination rows. Phase III : Permute the elements within ....

C. S. Raghavendra and V. K. Prasanna Kumar. Permutations on ILLIACIV Type Networks. IEEE Transactions on Computers, C-37(7):622--629, July 1986.

No context found.

C. S. Raghavendra and V. K. Prasanna Kumar. Permutations on illiac iv-type networks. IEEE Transactions on Computers, pages 662--669, July 1986.

No context found.

C.S. Raghavendra and V.K.P. Kumar, Permutations on Illiac IV-Type Networks, IEEE Trans. Comp., 35 (1986) pp. 662--669.

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