Title :
An analysis of disjoint path properties in data manipulator networks
Author :
Nation, Wayne G. ; Siegel, Howard Jay
Author_Institution :
Parallel Processing Lab., Purdue Univ., West Lafayette, IN, USA
Abstract :
Properties of disjoint paths between a given source (S) and destination (D) in data manipulator networks are examined. The condition that must be present to have disjoint paths through the network for a given S and D pair is presented. It is proven that the maximum number of disjoint paths for any S/D pair is two, and a method for finding the routing tags that specify these paths is given. The effect of a fault in a given stage of the network on the number of S/D pairs that can be connected is also discussed
Keywords :
fault tolerant computing; multiprocessor interconnection networks; data manipulator networks; destination; disjoint path properties; fault; source; Computer networks; Concurrent computing; Intelligent networks; LAN interconnection; Laboratories; Large-scale systems; Multiprocessor interconnection networks; Parallel processing; Routing; Supercomputers;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
DOI :
10.1109/FMPC.1988.47415
