Realisation of pipelined mesh algorithms on hypercubes

Presents efficient techniques for realisation of pipelined mesh algorithms on hypercubes. A mesh algorithm is an algorithm inherently suited to a mesh-connected iterative logic array. Previous treatment of the subject by other researchers was concerned mostly with the embedding of a mesh on a hypercube which must be big enough to host all the mesh points. The authors consider a more practical situation: transferring algorithms from 2D pipelined meshes to hypercubes without restriction on the sizes of the hypercubes or the meshes. The approach guarantees an optimal mapping, where processor utilisation is concerned.