Some Communication Aspects in Extended Fibonacci Cubes

The interconnection network is an essential aspect of a distributed system or of a supercomputer based on large-sale parallel processing. In the case of direct interconnection network a processor communicates using direct links only with its neighbors that means the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combinatorics and graph theory. The communication is a very important issue in interconnection networks for distributed systems because the exchange of information is based on message exchange. A number of interconnection network topology as hypercube, cube connected cycles, de Bruijn, star-graph, pancake graph have been studied.The Fibonacci Cube and Extended Fibonacci Cube, are two topologies based on the sequence of Fibonacci numbers which provide good properties for an interconnection network regarding diameter, node degree, recursive decomposition, embeddability and communication algorithms. In this paper we present some properties of the Extended Fibonacci Cubes and we give two algorithms for communication in Extended Fibonacci Cubes, one for routing and one for broadcasting a message. Both algorithms use the shortest path between two nodes and are deadlock free.