Parallel prefix computation on a pyramid computer
Pattern Recognition Letters
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
A routing algorithm for the pyramid structures
Proceedings of the 2001 ACM symposium on Applied computing
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
Graph Containers, Information Delay, and Network Vulnerability
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Generalized Diameters of the Mesh of Trees
Theory of Computing Systems
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
An efficient construction of node disjoint paths in OTIS networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Hi-index | 0.00 |
Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network (EPM, for short), by replacing each mesh in a pyramid network (PM, for short) with a torus. Recently, some topological properties and communication on the EPMs have been investigated or derived. Their results have revealed that an EPM is an attractive alternative to a PM. This study investigates the node-disjoint paths between any two distinct nodes and the upper bound of the ω-wide-diameter of an EPM. This result shows that the EPMs have smaller ω-wide-diameters than the PMs.