The Inverse Augmented Data Manipulator (IADM) is a multistage interconnection network based on the Augmented Data Manipulator (ADM) and Feng's data manipulator. It is designed to be used in large-scale parallel/distributed processing systems for communication among processors, memories, and other system devices. Two aspects of IADM network design are discussed: performance and fault tolerance. A single stage look-ahead scheme for predicting blockage is presented to enhance performance. Next, one method of adding some links to the network to enable it to tolerate one link failure is described. Finally, a different method of adding links is shown that both improves performance and allows the network to tolerate two switching element or two link failures. Included is a new routing tag scheme that accommodates the new links.

There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the use of the Augmented Data Manipulator and Inverse Augmented Data Manipulator multistage networks in the MIMD mode of operation is considered. A tag based routing scheme which allows distributed control of either network is proposed. Rerouting schemes that allow a message blocked by a busy or known faulty node in its present path to dynamically make use of a nonbusy node and continue, when possible, are described for both networks. Finally, a tag based broadcasting scheme for the networks is introduced that allows one processor to send messages to a subset of the other processors.

There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the use of a multistage network in the MIMD mode of operation is considered. A tag based routing scheme is proposed for the Augmented Data Manipulator network. Also included is a rerouting scheme that allows a message blocked by a busy link in its present path to dynamically make use of a non-busy link and continue, when possible. Finally, a tag based broadcasting scheme is introduced that allows one processor to send messages to a power of two other processors.