
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Guihai Chen, Francis C.M. Lau, "Tighter Layouts of the CubeConnected Cycles," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 2, pp. 182191, February, 2000.  
BibTex  x  
@article{ 10.1109/71.841753, author = {Guihai Chen and Francis C.M. Lau}, title = {Tighter Layouts of the CubeConnected Cycles}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {2}, issn = {10459219}, year = {2000}, pages = {182191}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.841753}, 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  Tighter Layouts of the CubeConnected Cycles IS  2 SN  10459219 SP182 EP191 EPD  182191 A1  Guihai Chen, A1  Francis C.M. Lau, PY  2000 KW  Interconnection networks KW  cubeconnected cycles KW  VLSI KW  embedding KW  routing KW  layout. VL  11 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Preparata and Vuillemin proposed the cubeconnected cycles (
[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] A. Avior, T. Calamoneri, S. Even, A. Litman, and A.L. Rosenberg, “A Tight Layout of the Butterfly Network,” Theory of Computing Systems, vol. 31, no. 4, pp. 475488, 1998.
[3] K.E. Batcher, “The Flip Network in STARAN,” Proc. Int'l Conf. Parallel Processing, pp. 65–71, 1976.
[4] R. Beigel and C.P. Kruskal, "Processor Networks and Interconnection Networks without Long Wires," Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 4251, 1989.
[5] S.N. Bhatt and F.T. Leighton, “A Framework for Solving VLSI Graph Layout Problem,” J. Computer and System Sciences, vol. 28, no. 2, pp. 300–343, 1984.
[6] N. Blum, “An AreaMaximum Edge Length Tradeoff for VLSI Layout,” Information and Control, vol. 66,no. 1/2, pp. 4552, 1984.
[7] G. Chen and F.C.M. Lau, Layout of CCC without Long Wires, Technical Report 9709, Dept. of Computer Science and Information Systems, University of Hong Kong, 1997.
[8] G. Chen and F.C.M. Lau, “Comments on a New Family of Cayley Graph Interconnection Networks of Constant degree Four,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1,2991,300, Dec. 1997.
[9] Y. Dinitz, A Compact Layout of Butterfly on the Square Grid, Technical Report 873, TechnionIsrael Inst. of Technology, Haifa, Israel, Nov. 1995.
[10] R. Feldmann and W. Unger, “The CubeConnected Cycles Network Is a Subgraph of the Butterfly Network,” Parallel Processing Letters, vol. 2, no. 1, pp. 1319, 1992.
[11] C.P. Kruskal and M. Snir, “A Unified Theory of Interconnection Network Structure,” Theoretical Computer Science, vol. 48, pp. 7594, 1986.
[12] F.C.M. Lau and G. Chen, “Optimal Layouts of Midimew Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 9, pp. 954–961, Sept. 1996.
[13] F.T. Leighton, Complexity Issues in VLSI: Optimal Layout for the ShuffleExchange Graph and Other Networks. MIT Press, 1983.
[14] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[15] C. Mead and L. Conway, Introduction to VLSI Systems, AddisonWesley, Reading, Mass., 1980.
[16] K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh, “Channel Routing in KnockKnee Mode: Simplified Algorithms and Proofs,” Algorithmica, vol. 1, pp. 213–221, 1986.
[17] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[18] C.D. Thompson, "AreaTime Complexity for VLSI," Proc. 11th Ann. Symp. Theory of Computing, pp. 8188, 1979.
[19] C.D. Thompson,“A complexity theory for VLSI,” PhD thesis, CarnegieMellon Univ., Aug. 1980.
[20] D.S. Wise, “Compact Layouts of Banyan/FFT Networks,” VLSI Sytems and Computations, H.T. Kung, R. Sproull, and G. Steele, eds., pp. 186–195, SpringerVerlag, 1981.