scientific article; zbMATH DE number 3876584

From MaRDI portal
Publication:3341891





[For the entire collection see Zbl 0527.00033.] The hypercube and its derivative networks (e.g., the shuffle-exchange graph and the cube-connected cycles) have long been known to be powerful networks for parallel computation. Recently, an entirely different class of networks has been discovered that appears to rival the hypercube-based networks in usefulness. In this paper, we describe the new networks (which we call meshes of trees), and we show how they can be used to solve problems such as sorting, matrix-vector multiplication, discrete Fourier transform, transitive closure, minimum spanning tree, integer multiplication and matrix multiplication in \(O(\log N)\) or \(O(\log^ 2 N)\) steps.











This page was built for publication:

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