Communications of the ACM - Special section on computer architecture
Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
High-performance computer architecture
High-performance computer architecture
Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
Topological Properties of Hypercubes
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Embedding meshes in Boolean cubes by graph decomposition
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Parallel Sorting Algorithms
Interconnection Networks for Parallel and Distributed Processing
Interconnection Networks for Parallel and Distributed Processing
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Linear recursive networks and their applications in topological design and data routing
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Structural and Tree Embedding Aspects of Incomplete Hypercubes
IEEE Transactions on Computers
Linear Recursive Networks and Their Applications in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
On the Sizes of Extended Fibonacci Cubes
IEEE Transactions on Parallel and Distributed Systems
The Postal Network: A Recursive Network for Parameterized Communication Model
The Journal of Supercomputing
Embedding of fault-tolerant trees in the Josephus Cube
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
The observability of the Fibonacci and the Lucas cubes
Discrete Mathematics
Structural and enumerative properties of the Fibonacci cubes
Discrete Mathematics
How Network Topology Affects Dynamic Load Balancing
IEEE Parallel & Distributed Technology: Systems & Technology
IEEE Transactions on Parallel and Distributed Systems
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Observability of the extended Fibonacci cubes
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Unicast, Multicast, and Broadcast on Enhanced Fibonacci Cubes
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
Combinatorics and algorithms for low-discrepancy, roundings of a real sequence
Theoretical Computer Science - Automata, languages and programming
IEEE Transactions on Parallel and Distributed Systems
Minimal change list for Lucas strings and some graph theoretic consequences
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
A k-cube graph construction for mappings from binary vectors to permutations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Information Sciences: an International Journal
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Discrete Applied Mathematics
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Computers & Mathematics with Applications
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Asymptotic number of isometric generalized Fibonacci cubes
European Journal of Combinatorics
Cube Polynomial of Fibonacci and Lucas Cubes
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
A fault-tolerant routing strategy for fibonacci-class cubes
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Theoretical Computer Science
Note: Maximal hypercubes in Fibonacci and Lucas cubes
Discrete Applied Mathematics
Note: Fibonacci (p, r)-cubes which are median graphs
Discrete Applied Mathematics
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |
A novel interconnection topology called the Fibonacci cube is shown to possessattractive recurrent structures in spite of its asymmetric and relatively sparseinterconnections. Since it can be embedded as a subgraph in the Boolean cube(hypercube) and it is also a supergraph of other structures, the Fibonacci cube may findapplications in fault-tolerant computing. For a graph with N nodes, the diameter, theedge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmicorder of N. It is also shown that common system communication primitives can beimplemented efficiently.