Title :
Extended Fibonacci cubes
Author_Institution :
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA
Abstract :
The Fibonacci cube (FC) is an interconnection network that possesses many desirable properties that are important in network design and application. However, most Fibonacci cubes (more than two third of all) are not Hamiltonian. In this paper, we propose a new network topology called extended Fibonacci cube (EFC1) based on the same sequence F(i)=F(i-1)+F(i-2) as the regular Fibonacci sequence but with different initial values. We also propose a series of extended Fibonacci cubes with even number of nodes. Any extended Fibonacci cube (EFCk, with k⩾1) in the series contains the node set of any other cube that precedes EFCk in the series. We show that any extended Fibonacci cube maintains virtually all the desirable properties of the Fibonacci cube. EFCk´s can be considered as flexible versions of incomplete hypercubes which eliminate the restriction on the number of nodes and thus makes it possible to construct parallel machines with arbitrary sizes
Keywords :
multiprocessor interconnection networks; parallel machines; arbitrary sizes; extended Fibonacci cubes; flexible versions; interconnection network; network topology; parallel machines; Application software; Binary trees; Computer science; Design engineering; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel machines;
Conference_Titel :
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on
Conference_Location :
San Antonio, TX
Print_ISBN :
0-81867195-5
DOI :
10.1109/SPDP.1995.530691