Parallel prefix computation on extended multi-mesh network.

From MaRDI portal





A parallel algorithm for prefix computation of \(N=n^{4}\) elements on an \(n\times n\) extended multi-mesh network is presented. The network is a modified version of an earlier multi-mesh network with a 4-regular structure. The algorithm takes \(O(N^{1/4})\) time on \(N\) processors (\(13N^{1/4}-5\) communication steps and \(\log N+4\) arithmetic/logic steps).











This page was built for publication: Parallel prefix computation on extended multi-mesh network.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853159)