South Dakota State University
Simulation of Various Networks on Fibonacci Cube Network Topology
Abstract
dc:description.abstractSimulation of one interconnection topology by another has several applications in efficient uses of parallel computation networks. The Fibonacci Cube network was proposed recently, [16], [17], (18], [19], [20], [21] as an alternative to the Hypercube networks. Fibonacci Cube networks have rich properties of Fibonacci numbers and hence they can flexibly be decomposed into subgraphs of the same kind. However, there is a tremendous gap between Hypercubes and Fibonacci Cubes with respect to the availability of routing and graph embedding results. These problems have been studied extensively on Hypercubes [2], [4], [6], [7], [24], [25], [27], [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both dilation and expansion.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - University Access Only
- Discipline thesis:degree_discipline
- Electrical Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Sharma, Sanjay
- Contributors dc:contributor
-
- Bin Cong
Subjects
dc:subject × 2Rights
- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd/5855