Search

Mesh-connected trees (MCT) are a class of parallel architectures that execute grid algorithms as efficiently as the grid, and the mesh of tree (MOT) algorithms as efficiently as the MOT. The MCT matches the running time of well known hypercube algorithms. A simple variant of the MCT architecture admits both the MOT and the torus as its subgraphs. The MCT network has large enough band width, to be considered as a low cost alternative for general purpose parallel computers.

A new method has been developed for achieving multicast communication in parallel processing systems. The proposed protocol uses propagation trees to ensure total ordering of message delivery and to guarantee that all recipients will receive the messages concurrently in the same relative order. It also reduces the time needed to multicast the messages to all the destinations.