
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Frank Hsu, David S.L. Wei, "Efficient Routing and Sorting Schemes for de Bruijn Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 11571170, November, 1997.  
BibTex  x  
@article{ 10.1109/71.642950, author = {D. Frank Hsu and David S.L. Wei}, title = {Efficient Routing and Sorting Schemes for de Bruijn Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {11}, issn = {10459219}, year = {1997}, pages = {11571170}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.642950}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Efficient Routing and Sorting Schemes for de Bruijn Networks IS  11 SN  10459219 SP1157 EP1170 EPD  11571170 A1  D. Frank Hsu, A1  David S.L. Wei, PY  1997 KW  Oblivious routing KW  nonoblivious routing KW  permutation routing KW  parallel sorting KW  de Bruijn network. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We consider the problems of routing and sorting on a de Bruijn network. First, we show that any deterministic oblivious routing scheme for permutation routing on a
[1] S. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the nCube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] S.G. Akl, Parallel Sorting Algorithms.Orlando, Fla.: Academic Press Inc., 1985.
[3] R. Aleliunas, "Randomized Parallel Communication," ACMSIGOPS Symp. Principles of Distributed Systems, pp. 6072, 1982.
[4] K. Batcher, "Sorting Networks and Their Applications," Proc. AFIPS Spring Joint Computing Conf., pp. 307314, 1968.
[5] A. Borodin and J.E. Hopcroft, “Routing, Merging and Sorting on Parallel Models of Computation,” Proc. STOC, pp. 338344, 1982.
[6] M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer and System Sciences, vol. 7, no. 4, pp. 448461, 1973.
[7] J.C. Bermond and C. Peyrat, "de Bruijn and Kautz Networks: A Competitor for the Hypercube?," Hypercube and Distributed Computers, F. André, and J.P. Verjus, eds., pp. 279293. Elsevier Science Publishers, 1989.
[8] S.B. Choi and A.K. Somani, "Rearrangeable CircuitSwitched Architectures for Routing Permutations," J. Parallel and Distributed Computing, vol. 19, no. 2, pp. 125130, Oct. 1993.
[9] O. Collins, S. Dolinar, R. McEliece, and F. Pollara, "A VLSI Decomposition of the De Bruijn Graph," J. ACM, vol. 39, pp. 931948, Oct. 1992..
[10] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[11] R. Cypher and C.G. Plaxton, "Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers," J. Computer and System Sciences, vol. 47, pp. 501548, Dec. 1993.
[12] N.G. de Bruijn, "A Combinatorial Problem," Proc. Akademe Van Wetenschappen, vol. 49, pp. 758764, 1946.
[13] A.H. Esfahanian and S.L. Hakimi, “FaultTolerant Routing in de Bruijn Communication Networks,” IEEE Trans. Computers, vol. 34, no. 9, pp. 777788, Sept. 1985.
[14] M.D. Grammatikakis, D.F. Hsu, and F.K. Hwang, "Adaptive and Oblivious Algorithms for DCube Permutation Routing," Algorithms and Computation,. LNCS, no. 762, pp. 167175. SpringerVerlag, 1993.
[15] D.F. Hsu and D.S.L. Wei, "Permutation Routing and Sorting on Directed de Bruijn Networks," Proc. Int'l Conf. Parallel Processing, vol. 1, Architecture, pp. 96100, P. Banerjee, ed. CRC Press, 1995.
[16] G. Waldman, J. Wootton, and G. Hobson, “Visual Detection with Search: An Empirical Model,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, pp. 596606, 1991.
[17] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. AddisonWesley, 1973.
[18] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[19] F.T. Leighton,B. Maggs, and S. Rao,"Universal Packet Routing Algorithms," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 256269, 1988.
[20] Z. Liu and T.Y. Sung, "Routing and Transmitting Problems in de Bruijn Networks," IEEE Trans. Computers, vol. 45, no. 9, pp. 1,0561,062, Sept. 1996.
[21] A. Menn and A.K. Somani, "An Efficient Sorting Algorithm for the Star Graph Interconnection Network," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 18, 1990.
[22] M. Palis, S. Rajasekaran, and D.S.L. Wei, “Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks,” J. Parallel and Distributed Computing, vol. 20, no. 2, pp. 145157, Feb. 1994.
[23] S. Rajasekaran and D.S.L. Wei, "Selection, Routing and Sorting on the Star Graph," J. Parallel and Distributed Computing, vol. 41, pp. 225233, Apr. 1997.
[24] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[25] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263277, May 1981.
[26] D.S.L. Wei, "Quicksort and Permutation Routing on the Hypercube and de Bruijn Networks," Proc. Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 238245, S. Horiguchi et. al, eds. IEEE CS Press, 1994.