Data movement techniques for the pyramid computer
SIAM Journal on Computing
A cycle structure theorem for Hamiltonian graphs
Journal of Combinatorial Theory Series A
Mapping pyramid algorithms into hypercubes
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Pancyclism and bipancyclism of Hamiltonian graphs
Journal of Combinatorial Theory Series B
Embedding pyramids into 3D meshes
Journal of Parallel and Distributed Computing
A note on the minimum size of a vertex pancyclic graph
Selected papers from the second Krakow conference on Graph theory
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Journal of Combinatorial Theory Series B
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
On pancyclism in hamiltonian graphs
Discrete Mathematics
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
The WK-Recursive Pyramid: An Efficient Network Topology
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Journal of Graph Theory
Journal of Systems Architecture: the EUROMICRO Journal
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
On pancyclicity properties of OTIS networks
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 0.00 |
The Pyramid network is a desirable network topology used as both software data-structure and hardware architecture. In this paper, we propose a general definition for a class of pyramid networks that are based on grid connections between the nodes in each level. Contrary to the conventional pyramid network in which the nodes in each level form a mesh, the connections between these nodes may also be according to other grid-based topologies such as the torus, hypermesh or WK-recursive. Such pyramid networks form a wide class of interconnection networks that possess rich topological properties. We study a number of important properties of these topologies for general-purpose parallel processing applications. In particular, we prove that such pyramids are Hamiltonian-connected, i.e. for any arbitrary pair of nodes in the network there exists at least one Hamiltonian path between the two given nodes, and pancyclic, i.e. any cycle of length 3, 4 驴 and N, can be embedded in a given N-node pyramid network. It is also proven that two link-disjoint Hamiltonian cycles exist in the torus-pyramid and hypermesh-pyramid networks.