Optimal fault-tolerant networks with a server
β Scribed by Choudum, S. A.; Sivagurunathan, S.
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 93 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
Fast computation through parallel processing and large distributed memory are two important qualities of new multiprocessor computing machines. Various processors of these machines are interconnected through a suitable network. However, a fault in a single processor may drastically reduce the performance rate of these machines. Hence, the designing aspects of faulttolerant networks have received much attention in recent years. A network N N N with n n n + k k k processors is called a k k k-fault-tolerant network with respect to a target network N N N with n n n processors if every truncated network of N N N with k k k faulty processors retains the network of N N N. A processor in a network which is connected to all other processors is called a server. In this paper, we characterize the k k k-fault-tolerant networks when the target network contains a server.
π SIMILAR VOLUMES
In this paper, we propose a solution to both fault tolerance and hot-spot contention problems in multiprocessor systems with multistage interconnection networks. Combining networks are known to be effective in handling hot-spot traffic. However, the fault tolerance capability of unique-path combinin