Parallel computation: parallel communication

The author uses the following result from contemporary computer science: the ability of two-phase randomised routing to support scalable throughput and low delay when routing on hypercubes (even when routing among the plog(p) processes distributed among p processors) together with the existence of message-passing hardware: processors, preferably with efficient process scheduling, in which processing throughput and communication throughput is balanced communication networks with scalable throughput and low delay and have shown that one can already construct scalable universal message passing machines. For these machines, one can write scalable, portable software exploiting message passing.<
>