This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Compressions of Cube-Connected Cycles Networks
August 1998 (vol. 9 no. 8)
pp. 803-812

Abstract—We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. Using the new embedding strategy, we show that the CCC of dimension l can be embedded into the CCC of dimension k with dilation 1 and optimum load for any k, $l \in {\hbox{\sl{\rlap{N}\kern1.5pt{\hbox{N}}}}},$k≥ 8, such ${\textstyle{5 \over 3}}+c_k<{\textstyle{l \over k}}\le 2,$$c_k={\textstyle{{4k +3} \over {3\cdot 2^{{2 \mathord{\left/ {\vphantom {2 3}} \right. \kern-\nulldelimiterspace} 3}k}}}},$ thus improving known results. Our embedding technique also leads to improved dilation-1 embeddings in the case ${\textstyle{3 \over 2}}<{\textstyle{l \over k}}\le {\textstyle{5 \over 3}}+c_k.$

[1] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, “Group Action Graphs and Parallel Architectures,” SIAM J. Computing, vol. 19 pp. 544-569, 1990.
[2] F. Berman and L. Snyder, "On Mapping Parallel Algorithms into Parallel Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 439-458, 1987.
[3] S.N. Bhatt and J.-Y. Cai, "Taking Random Walks to Grow Trees in Hypercubes," J. ACM, vol. 40, pp. 741-764, 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. 151-162, 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 Butterfly-Like Networks,” J. ACM, vol. 43, pp. 293-330, 1996.
[6] H.L. Bodlaender, "The Classification of Coverings of Processor Networks," J Parallel and Distributed Computing, vol. 6, pp. 166-182, 1989.
[7] H.L. Bodlaender and J. van Leeuwen, "Simulation of Large Networks on Smaller Networks," Information and Control, vol. 71, pp. 143-180, 1986.
[8] S.H. Bokhari, "On the Mapping Problem," IEEE Trans. Computers, vol. 30, pp. 207-214, 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. 714-715, 1991.
[10] R. Feldmann and W. Unger, "The Cube-Connected-Cycle Is a Subgraph of the Butterfly Network," Parallel Processing Letters, vol. 2, pp. 13-19, 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. 288-295, 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. 179-198, 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. 329-346, 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. 1-8, 1988.
[16] R. Klasing, R. Lüling, and B. Monien, "Compressing Cube-Connected Cycles and Butterfly Networks," Proc. Second IEEE Symp. Parallel and Distributed Processing (SPDP'90), pp. 858-865, 1990, also Networks, to appear.
[17] R. Koch, F.T. Leighton, B.M. Maggs, S.B. Rao, A.L. Rosenberg, and E.J. Schwabe, “Work-Preserving Emulations of Fixed-Connection Networks,” J. ACM, vol. 44, pp. 104-147, 1997.
[18] S.R. Kosaraju and M.J. Atallah, "Optimal Simulations Between Mesh-Connected Arrays of Processors," J. ACM, vol. 35, pp. 635-650, 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 Job-Shop Scheduling in O(congestion + dilation) Steps," Combinatorica, vol. 14, pp. 167-186, 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. 639-654, 1992.
[22] Z. Miller and I.H. Sudborough, "Compressing Grids into Small Hypercubes," Networks, vol. 24, pp. 327-358, 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.1-12, Jan. 1986.
[24] B. Monien, "Simulating Binary Trees on X-Trees," Proc. Third ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 147-158, 1991.
[25] B. Monien and I.H. Sudborough, "Embedding One Interconnection Network in Another," Computing Supplementum, vol. 7, pp. 257-282, 1990.
[26] P.A. Nelson and L. Snyder, "Programming Solutions to the Algorithm Contraction Problem," Proc. Int'l Conf. Parallel Processing, pp. 258-261, 1986.
[27] R. Peine, "Cayley-Graphen und Netzwerke," master's thesis, Universität-GH Paderborn, Fachbereich 17-Mathematik/Informatik, Germany, 1990.
[28] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[29] A.L. Rosenberg, "Graph Embeddings 1988: Recent Breakthroughs, New Directions," Proc. Third Aegean Workshop Computing (AWOC): VLSI Algorithms and Architectures, pp. 160-169, 1988.
[30] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.

Index Terms:
Parallel computations, parallel architectures, interconnection networks, graph embedding, network simulation, cube-connected cycles network.
Citation:
Ralf Klasing, "Improved Compressions of Cube-Connected Cycles Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 803-812, Aug. 1998, doi:10.1109/71.706051
Usage of this product signifies your acceptance of the Terms of Use.