Issue No.01 - January (1999 vol.48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.743415
<p><b>Abstract</b>—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.</p>
Pyramid, fault-tolerant routing, line connectivity, parallel computing.
Feng Cao, Ding-Zhu Du, D. Frank Hsu, Shang-hua Teng, "Fault Tolerance Properties of Pyramid Networks", IEEE Transactions on Computers, vol.48, no. 1, pp. 88-93, January 1999, doi:10.1109/12.743415