Abstract
A parallel algorithm for prefix computation on [Formula: see text] data elements mapped on a Multi Mesh (MM) network of [Formula: see text] processing elements is presented here. The time required by the proposed algorithm is significantly less than that by any of the existing algorithms for prefix computation on mesh-like architectures due to the specific interconnection pattern used in the MM network. The proposed technique requires [Formula: see text] time for data communication and [Formula: see text] time for computation, when mapped on a MM network constituted by [Formula: see text] meshes, each of size [Formula: see text]. The data communication time in the proposed algorithm is less than the prefix sum algorithm proposed in extended Multi Mesh. To be precise, instead of [Formula: see text] communication time the proposed algorithm requires a data communication time of [Formula: see text] only. Moreover, the proposed parallel algorithm does not need any extra inter block links as used in the extended Multi Mesh.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call