Sorting on a mesh-connected parallel computer
From MaRDI portal
Publication:4120129
DOI10.1145/359461.359481zbMath0349.68020OpenAlexW2066104460MaRDI QIDQ4120129
Publication date: 1977
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359461.359481
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (50)
A VLSI algorithm for sorting variable-length character strings ⋮ A neural sorting network with O(1) time complexity ⋮ Flit-serial packet routing on meshes and tori ⋮ The balanced binary tree technique on mesh-connected computers ⋮ Solving visibility problems on MCCs of smaller size ⋮ A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues ⋮ Space and time complexities of balanced sorting on processor arrays ⋮ Solving visibility and separability problems on a mesh-of-processors ⋮ Geometric problems on two-dimensional array processors ⋮ A VLSI partition algorithm ⋮ Sorting in constant number of row and column phases on a mesh ⋮ AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ ⋮ SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ ⋮ TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors ⋮ Sloping-and-shaking ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Time lower bounds for parallel sorting on a mesh-connected processor array ⋮ Fast deterministic selection on mesh-connected processor arrays ⋮ VLSI-sorting evaluated under the linear model ⋮ A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation ⋮ Branch-and-bound and backtrack search on mesh-connected arrays of processors ⋮ A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors ⋮ Discrete configuration spaces of squares and hexagons ⋮ Robust algorithms for packet routing in a mesh ⋮ Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ A constant-time parallel algorithm for computing convex hulls ⋮ Computing convexity properties of images on a pyramid computer ⋮ Computational geometry algorithms for the systolic screen ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ An efficient selection algorithm on the pyramid ⋮ Randomized multipacket routing and sorting on meshes ⋮ Indexing functions and time lower bounds for sorting on a mesh-connected computer ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ An elegant algorithm for the construction of suffix arrays ⋮ Integer sorting on a mesh-connected array of processors ⋮ Packet Routing on grids of processors ⋮ Computing Hough transforms on hypercube multicomputers ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Simulating the Bitonic Sort Using P Systems ⋮ A unified algorithm for sorting on multidimensional mesh-connected processors ⋮ A generalization of the zero-one principle for sorting algorithms ⋮ A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ Scalable algorithms for the mesh with buses: merging, sorting and selection ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ Swapping labeled tokens on graphs ⋮ k-fold bitonic sort on a mesh-connected parallel computer
This page was built for publication: Sorting on a mesh-connected parallel computer
