Fast parallel prefix on multi-mesh of trees

The multi-mesh of trees (MMT) is an efficient interconnection network, which is a hybrid product of multi-mesh and mesh of trees networks. Several parallel algorithms have been efficiently mapped on this architecture for various problems including root finding, langrage interpolation, matrix multiplication and parallel sorting. In this paper, we propose a parallel algorithm for prefix computation for N = n⁴ data on an iV-processor multi-mesh of trees which takes 3.75 log N + 6 time for N data points. This can be compared with parallel prefix on the similar architecture, i.e., multi-mesh (MM) which requires 13N^1/4 + log N -1 time.