
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ralf Klasing, "Improved Compressions of CubeConnected Cycles Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 803812, August, 1998.  
BibTex  x  
@article{ 10.1109/71.706051, author = {Ralf Klasing}, title = {Improved Compressions of CubeConnected Cycles Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {8}, issn = {10459219}, year = {1998}, pages = {803812}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.706051}, 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  Improved Compressions of CubeConnected Cycles Networks IS  8 SN  10459219 SP803 EP812 EPD  803812 A1  Ralf Klasing, PY  1998 KW  Parallel computations KW  parallel architectures KW  interconnection networks KW  graph embedding KW  network simulation KW  cubeconnected cycles network. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We present a new technique for the embedding of large cubeconnected cycles networks (
[1] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, “Group Action Graphs and Parallel Architectures,” SIAM J. Computing, vol. 19 pp. 544569, 1990.
[2] F. Berman and L. Snyder, "On Mapping Parallel Algorithms into Parallel Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 439458, 1987.
[3] S.N. Bhatt and J.Y. Cai, "Taking Random Walks to Grow Trees in Hypercubes," J. ACM, vol. 40, pp. 741764, 1993.
[4] S.N. Bhatt, F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg, "Efficient Embeddings of Trees in Hypercubes," SIAM J. Computing, vol. 21, no. 1, pp. 151162, 1992.
[5] S.N. Bhatt, F.R.K. Chung, J.W. Hong, F.T. Leighton, B. Obrenic, A.L. Rosenberg, and E.J. Schwabe, “Optimal Emulations by ButterflyLike Networks,” J. ACM, vol. 43, pp. 293330, 1996.
[6] H.L. Bodlaender, "The Classification of Coverings of Processor Networks," J Parallel and Distributed Computing, vol. 6, pp. 166182, 1989.
[7] H.L. Bodlaender and J. van Leeuwen, "Simulation of Large Networks on Smaller Networks," Information and Control, vol. 71, pp. 143180, 1986.
[8] S.H. Bokhari, "On the Mapping Problem," IEEE Trans. Computers, vol. 30, pp. 207214, 1981.
[9] M.Y. Fang and W.T. Chen, "Embedding Large Binary Trees to Hypercube Multiprocessors," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 714715, 1991.
[10] R. Feldmann and W. Unger, "The CubeConnectedCycle Is a Subgraph of the Butterfly Network," Parallel Processing Letters, vol. 2, pp. 1319, 1992.
[11] M.R. Fellows, "Encoding Graphs in Graphs," PhD dissertation, Univ. of California at San Diego, 1985.
[12] J.P. Fishburn and R.A. Finkel, "Quotient Networks," IEEE Trans. Computers, vol. 31, pp. 288295, 1982.
[13] A.K. Gupta and S.E. Hambrusch, "Embedding Large Tree Machines into Small Ones," Proc. Fifth MIT Conf. Advanced Research in VLSI, pp. 179198, 1988.
[14] A. Heirich, "A Scalable Diffusion Algorithm for Dynamic Mapping and Load Balancing on Networks of Arbitrary Topology," Int'l J. Foundations of Computer Science, vol. 8, pp. 329346, 1997.
[15] S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computations upon Multiprocessor Architectures," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 18, 1988.
[16] R. Klasing, R. Lüling, and B. Monien, "Compressing CubeConnected Cycles and Butterfly Networks," Proc. Second IEEE Symp. Parallel and Distributed Processing (SPDP'90), pp. 858865, 1990, also Networks, to appear.
[17] R. Koch, F.T. Leighton, B.M. Maggs, S.B. Rao, A.L. Rosenberg, and E.J. Schwabe, “WorkPreserving Emulations of FixedConnection Networks,” J. ACM, vol. 44, pp. 104147, 1997.
[18] S.R. Kosaraju and M.J. Atallah, "Optimal Simulations Between MeshConnected Arrays of Processors," J. ACM, vol. 35, pp. 635650, 1988.
[19] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[20] F.T. Leighton, B.M. Maggs, and S.B. Rao, "Packet Routing and JobShop Scheduling in O(congestion + dilation) Steps," Combinatorica, vol. 14, pp. 167186, 1994.
[21] F.T. Leighton, M.J. Newman, A.G. Ranade, and E.J. Schwabe, "Dynamic Tree Embeddings in Butterflies and Hypercubes," SIAM J. Computing, vol. 21, pp. 639654, 1992.
[22] Z. Miller and I.H. Sudborough, "Compressing Grids into Small Hypercubes," Networks, vol. 24, pp. 327358, 1994.
[23] D.I. Moldovan and J.A.B. Fortes, “Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays,” IEEE Trans. Computers, vol. 35, no. 1, pp.112, Jan. 1986.
[24] B. Monien, "Simulating Binary Trees on XTrees," Proc. Third ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 147158, 1991.
[25] B. Monien and I.H. Sudborough, "Embedding One Interconnection Network in Another," Computing Supplementum, vol. 7, pp. 257282, 1990.
[26] P.A. Nelson and L. Snyder, "Programming Solutions to the Algorithm Contraction Problem," Proc. Int'l Conf. Parallel Processing, pp. 258261, 1986.
[27] R. Peine, "CayleyGraphen und Netzwerke," master's thesis, UniversitätGH Paderborn, Fachbereich 17Mathematik/Informatik, Germany, 1990.
[28] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[29] A.L. Rosenberg, "Graph Embeddings 1988: Recent Breakthroughs, New Directions," Proc. Third Aegean Workshop Computing (AWOC): VLSI Algorithms and Architectures, pp. 160169, 1988.
[30] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.