Fault tolerance properties of pyramid networks

Author

Cao, Feng ; Du, Ding-Zhu ; Hsu, D. Frank ; Teng, Shang-hua

Author_Institution

Cisco Syst. Inc., San Jose, CA, USA

Volume

48

Issue

1

fYear

1999

fDate

1/1/1999 12:00:00 AM

Firstpage

88

Lastpage

93

Abstract

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

Keywords

fault tolerant computing; multiprocessor interconnection networks; parallel architectures; fault tolerance properties; image processing; network computing; parallel computing; polynomial-time algorithm; pyramid networks; Computer architecture; Computer networks; Computer science; Concurrent computing; Fault tolerance; Image processing; Multiprocessor interconnection networks; Parallel processing; Polynomials; Routing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.743415

Filename

743415