Some permutation routing algorithms for low-dimensional hypercubes-Reference-Cited by-同舟云学术

Some permutation routing algorithms for low-dimensional hypercubes

Published:2002-01 Issue:1-2 Volume:270 Page:111-124
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Hwang F.K.,Yao Y.C.,Dasgupta B.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference9 articles.

1. Routing, merging and sorting on parallel models of computation;Borodin;J. Comput. Syst. Sci.,1985

2. A. Borodin, P. Raghavan, B. Schieber, E. Upfal, How much can hardware help routing, Proceedings of the 25th ACM Symposium Theory Computing, 1993, pp. 573–582.

3. M.D. Grammatikakis, D.F. Hsu and F.K. Hwang, Universality of d-cube (d<8), in: D.G. Joubert, D. Trystram, F.J. Peters (Eds.), Proceedings of the Advancement in Parallel Computing, Elsevier, Amsterdam, 1993.

4. Comments on the oblivious routing algorithm of Kaklamanis, Krizanc and Tsantilas in the hypercube;Hwang;Theory of Computing Systems,1998

5. A d-move local permutation routing for the d-cube;Hwang;Discrete Appl. Math.,1997

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. One Step Ahead towards the Rearrangeability of 4D-Hypercube Interconnection Networks;Intelligent Information and Database Systems;2014

2. Graphs Partitioning: An Optimal MIMD Queueless Routing for BPC-Permutations on Hypercubes;Parallel Processing and Applied Mathematics;2010

3. Optimal permutation routing for low-dimensional hypercubes;Networks;2009-07-31

4. (ℓ, k)-ROUTING ON PLANE GRIDS;Journal of Interconnection Networks;2009-03

5. Permutation Routing and (ℓ, k)-Routing on Plane Grids;Texts in Theoretical Computer Science. An EATCS Series;2009