Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
IEEE Transactions on Computers
Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture
IEEE Transactions on Parallel and Distributed Systems
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Mapping Dynamic Data and Algorithm Structures into Product Networks
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Efficient Communication in the Folded Petersen Interconnection Network
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
Optimally adaptive, minimum-distance, circuit-switched routing in hypercubes
ACM Transactions on Computer Systems (TOCS)
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
A delay optimal coterie on the k-dimensional folded Petersen graph
Journal of Parallel and Distributed Computing
A new family of interconnection networks of fixed degree three
Journal of Computer Science and Technology
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
A generalized fault-tolerant sorting algorithm on a product network
Journal of Systems Architecture: the EUROMICRO Journal
A new family of interconnection networks of odd fixed degrees
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Containment properties of product and power graphs
Discrete Applied Mathematics
International Journal of Computer Mathematics
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Topological properties of hierarchical interconnection networks: a review and comparison
Journal of Electrical and Computer Engineering
On two-layer brain-inspired hierarchical topologies – a rent's rule approach –
Transactions on High-Performance Embedded Architectures and Compilers IV
Binomial graph: a scalable and fault-tolerant logical network topology
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
We introduce and analyze a new interconnection topology, called the k-dimensional folded Petersen (FPk) network, which is constructed by iteratively applying the Cartesian product operation on the well-known Petersen graph.Since the number of nodes in FPk is restricted to a power of ten, for better scalability we propose a generalization, the folded Petersen cube network FPQn,k = Qn脳FPk, which is a product of the n-dimensional binary hypercube (Qn) and FPk. The FPQn,k topology provides regularity, node- and edge-symmetry, optimal connectivity (and therefore maximal fault-tolerance), logarithmic diameter, modularity, and permits simple self-routing and broadcasting algorithms. With the same node-degree and connectivity, FPQn,k has smaller diameter and accommodates more nodes than Qn+3k, and its packing density is higher compared to several other product networks.This paper also emphasizes the versatility of the folded Petersen cube networks as a multicomputer interconnection topology by providing embeddings of many computationally important structures such as rings, multi-dimensional meshes, hypercubes, complete binary trees, tree machines, meshes of trees, and pyramids. The dilation and edge-congestion of all such embeddings are at most two.