This Article 
 Bibliographic References 
 Add to: 
Fibonacci Cubes-A New Interconnection Technology
January 1993 (vol. 4 no. 1)
pp. 3-12

A novel interconnection topology called the Fibonacci cube is shown to possessattractive recurrent structures in spite of its asymmetric and relatively sparseinterconnections. Since it can be embedded as a subgraph in the Boolean cube(hypercube) and it is also a supergraph of other structures, the Fibonacci cube may findapplications in fault-tolerant computing. For a graph with N nodes, the diameter, theedge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmicorder of N. It is also shown that common system communication primitives can beimplemented efficiently.

[1] S. G. Akl,Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
[2] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE. Trans. Comput., vol. C-33, pp. 323-333, 1984.
[3] G. Birkoff and T. C. Bartee,Modern Applied Algebra.New York: McGraw-Hill, 1970.
[4] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[5] J. P. Fishburn and R. A. Finkel, Quotient networks,"IEEE Trans. Comput., vol. C-31, no. 4, pp. 288-295, 1982.
[6] A. Gibbons,Algorithmic Graph Theory.Cambridge, MA: Cambridge University Press, 1985. ch. 4.
[7] R. L. Graham, D. E. Knuth, and O. Patashnik, "Special numbers," inConcrete Mathematics.Reading, MA: Addison-Wesley, 1989, ch. 6.
[8] J. P. Hayes,Computer Architecture and Organization. New York: McGraw-Hill, 1988.
[9] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[10] IEEE Comput. Mag., Special Issue on Interconnection Networks, vol. 20, 1987.
[11] C. -T. Ho and S. L. Johnsson, "On the embedding of arbitrary meshes in Boolean cubes with expansion two and dilation two," inProc. Int. Conf. Parallel Processing, 1987, pp. 188-191.
[12] C. T. Ho and S. L. Johnsson, "Embedding meshes in boolean cubes by graph decomposition,"J. Parallel and Distrib. Computing, Apr. 1990, pp. 325-339.
[13] W.-J. Hsu, Fibonacci cubes-A new computer architecture for parallel processing," Tech. Rep. CPS-90-04, Michigan State Univ., Oct. 1990.
[14] W.-J. Hsu and J.-S. Liu, Fibonacci codes as formal languages," Tech. Rep. CPS-91-04, Michigan State Univ., May 1991.
[15] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley, 1973.
[16] J.-S. Liu and W.-J. Hsu, "On embedding rings and meshes in Fibonacci cubes," Tech. Rep. CPS-91-01, Jan. 1991.
[17] X. Lin, L. M. Ni, and W.-J. Hsu, A foundation for multicast communication in multicomputers," Tech. Rep., CPS-89-2 (ACS-12), Michigan State Univ., Jan. 1989.
[18] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, May 1981.
[19] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[20] Y. Saad and M. H. Schultz, "Topological properties of the hypercubes,"IEEE Trans. Comput., vol. 37, no. 7, pp. 867-872, July 1988.
[21] Stone, H. S. 1987.High-Performance Computer Architecture. Reading, Mass., Addison-Wesley.
[22] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[23] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[24] C.L. Wu and T.Y. Feng,Interconnection Networks for Parallel and Distributed Processing, Computer Society Press, Los Alamitos, Calif., Order No. 574, 1984.

Index Terms:
Index Termssubgraph embedding; interconnection topology; Fibonacci cube; recurrent structures;sparse interconnections; Boolean cube; hypercube; supergraph; fault-tolerant computing;node connectivity; system communication primitives; graph theory; multiprocessorinterconnection networks; topology
W.J. Hsu, "Fibonacci Cubes-A New Interconnection Technology," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 1, pp. 3-12, Jan. 1993, doi:10.1109/71.205649
Usage of this product signifies your acceptance of the Terms of Use.