Fibonacci networks

摘要: Several Interconnection networks have been proposed in literature for interconnecting computing elements. The interconnection network usually forms a regular pattern, which is exploited by the algorithms running on the network. Some of the commercially available networks are the hypercube, mesh, etc., which are highly regular. The advantage of using such regular networks is that the algorithms written for one network can be extended with minimal effort to larger versions of the same network. However, networks like the hypercube, mesh, etc, have one significant disadvantage; they do not scale in increments of one. A hypercube scales in exponents of two, and a mesh scales in order of n or k, in an n x k mesh.A tree is the cheapest interconnection network but has unacceptably poor communication and fault-tolerant properties. On the other hand, the complete graph Kn is highly reliable but is extremely expensive …