FTN topology and protocols
Journal Article
·
· Journal of Parallel and Distributed Computing; (United States)
- Computer Science Dept., Advanced Concurrent Computation Lab., Arizona State Univ., Tempe, AZ (US)
In this paper the authors report on the development of a network called FTN that satisfies the requirements for a large class of fault tolerant applications in distributed processing. (N denotes the number of devices and m = (log{sub 2}N)). The network has a high fault tolerance: up to m {minus} 2 faulty processors can be tolerated. The fault tolerance is high and optimal. The criteria of optimality is the following: the number of vertex disjoint paths is equal to the minimal degree in the graph (m {minus} 1). The authors have developed algorithms to provide routing in both faulty and nonfaulty systems. The paths generated by the algorithms are nearly the shortest paths for any two source and destination processors. The network can be constructed for a system of an arbitrary size. The authors developed an algorithm which can add a new processor at the small cost of modifying only O(m) edges. The O(m) diameter implies a low transit delay. A multiplexing/demultiplexing protocol can utilize up to m {minus} 1 nonblocking paths between any two processors to achieve a high throughput. In general the network has much better fault tolerance than the recently reported Incomplete Cube, can be designed for any number of processors in contrast to the Boolean Cube, and it has a significantly lower cost than the Generalized Hypercube network in terms of the link count.
- OSTI ID:
- 5001687
- Journal Information:
- Journal of Parallel and Distributed Computing; (United States), Journal Name: Journal of Parallel and Distributed Computing; (United States) Vol. 11:1; ISSN JPDCE; ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
Similar Records
Adaptive fault-tolerant routing in hypercube multicomputers
Designing and reconfiguring fault-tolerant multiprocessor systems
Processor allocation and communication in networks
Journal Article
·
Fri Nov 30 23:00:00 EST 1990
· IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)
·
OSTI ID:5862333
Designing and reconfiguring fault-tolerant multiprocessor systems
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:7046530
Processor allocation and communication in networks
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6036610