|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Vittorio Scarano, "On the Sizes of Extended Fibonacci Cubes," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 7, pp. 764-766, July, 1999. | |||
| BibTex | x | ||
| @article{ 10.1109/71.780869, author = {Vittorio Scarano}, title = {On the Sizes of Extended Fibonacci Cubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {10}, number = {7}, issn = {1045-9219}, year = {1999}, pages = {764-766}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.780869}, 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 - On the Sizes of Extended Fibonacci Cubes IS - 7 SN - 1045-9219 SP764 EP766 EPD - 764-766 A1 - Vittorio Scarano, PY - 1999 KW - Parallel architectures KW - interconnection networks KW - Extended Fibonacci Cubes. VL - 10 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—Hypercube is a popular interconnection network whose size must be a power of 2. Several interconnection networks have been proposed that do not suffer this limitation. Among them the Extended Fibonacci Cubes [13] are based on the same sequence of the Fibonacci Cubes and share many appealing structural properties. In this paper, we show how Extended Fibonacci Cubes can be seen as (Cartesian) product graphs whose components are hypercubes and Fibonacci Cubes. By exposing this property, we prove a conjecture in [13] that there are no distinct Extended Fibonacci Cubes (except the trivial ones) with the same number of nodes. Our result further validates the motivations behind the proposal of this interconnection network as a flexible alternative to hypercubes.
[1] V. Auletta, A.A. Rescigno, and V. Scarano, “Embedding Graphs onto the Supercube,” IEEE Trans. Computers, vol. 44, no. 4, Apr. 1995.
[2] J. Bergum, B. Cong, and S. Sharma, “Simulations of Tree Structures on Fibonacci Cubes,” Proc. First Int'l Conf. Computer Comm. and Networks, pp. 279-283, 1992.
[3] L. Bhuyan and D.P. Agrawal, “Generalized Hypercubes and Hyperbus Structure for a Computer Network,” IEEE Trans. Computers, vol. 33, pp. 323-333, 1984.
[4] R.D. Carmichael, “A Simple Principle of Unification in the Elementary Theory of Numbers,” American Math. Monthly, vol. 36, 1929.
[5] J.H. Halton, “On the Divisibility Property of Fibonacci Numbers” Fibonacci Quarterly, vol. 4, no. 3, 1966.
[6] W.J. Hsu, "Fibonacci Cubes—A New Interconnection Topology," IEEE Trans. Parallel and Distributed Systems, vol 4, no.1, pp. 3-12, Jan. 1993.
[7] W.-J. Hsu, C.V. Page, and J.S. Liu, “Computing Prefixes on a Large Family of Interconnection Topologies,” Proc. 1992 Int'l Conf. Parallel Processing, vol. 3, pp. 153-159, 1992.
[8] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[9] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[10] A. Sen,“Supercube: An optimally fault tolerant network architecture,” Acta Informatica, vol. 26, pp. 741-748, 1989.
[11] I. Stojmenovic, “Routing and Broadcasting on Implete and Gray Code Incomplete Hypercubes,” Parallel Algorithms and Applications, vol. 1, pp. 167-177, 1993.
[12] I. Stojmenovic, “Optimal Deadlock-Free Routing and Broadcasting on Fibonacci Cubes,” Utilitas Mathematica, to appear.
[13] J. Wu, “Extended Fibonacci Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, Dec. 1997.