Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Static behavior analysis of a mesh system
Information Processing Letters
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay
IEEE Transactions on Computers
Parallel algorithms for regular architectures: meshes and pyramids
Parallel algorithms for regular architectures: meshes and pyramids
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
The calculation of average distance in mesh structures
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A routing algorithm for the pyramid structures
Proceedings of the 2001 ACM symposium on Applied computing
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
An alternative routing algorithm for the pyramid structures
Proceedings of the 2003 ACM symposium on Applied computing
An alternative routing algorithm for the pyramid structures
Proceedings of the 2003 ACM symposium on Applied computing
| Hi-index | 0.00 |
A pyramid structure of size n has a diameter of log n, which immediately leads to an optimal routing algorithm, using only parent-child links. However, shortest paths between nodes may be unavailable because of the existence of faulty nodes. On the other hand, there exist many other potential communication paths using links in the associated meshes.In this paper, we present an alternative routing algorithm making use of both mesh links and parent-child links, and study a set of bypassing paths associated with this algorithm.