Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Generalized de Bruijn digraphs
Networks
The Hamiltonian property of generalized de Bruijn digraphs
Journal of Combinatorial Theory Series B
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Reliability Analysis of Partitioned Optical Passive Stars Networks
LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Fault-tolerant routing and multicasting in butterfly networks
Proceedings of the 1999 ACM symposium on Applied computing
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
An alternative routing algorithm for the pyramid structures
Proceedings of the 2003 ACM symposium on Applied computing
The RTCC-pyramid: A Versatile Pyramid network
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
The Grid-Pyramid: A Generalized Pyramid Network
The Journal of Supercomputing
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Fault Tolerance in the Biswapped Network
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph
Information Sciences: an International Journal
The 3*-connected property of pyramid networks
Computers & Mathematics with Applications
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Constructing node-disjoint paths in enhanced pyramid networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
The star-pyramid graph: an attractive alternative to the pyramid
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Theoretical Computer Science
| Hi-index | 15.00 |
In this paper, we study the pyramid network (also called pyramid), one of the important architectures in parallel computing, network computing, and image processing. Some properties of pyramid networks are investigated. We determine the line connectivity and the fault diameters in pyramid networks. We show how to construct a path between two nodes in the faulty pyramid networks in polynomial time. A polynomial-time algorithm is also given for generating the containers in pyramid networks. Our results show that pyramid networks have very good fault tolerance properties