A unified algorithm for sorting on multidimensional mesh-connected processors

DOI10.1016/0020-0190(91)90193-LzbMATH Open0714.68016MaRDI QIDQ751246FDOQ751246

Authors: Peter F. Corbett, Isaac D. Scherson 

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4035170
• k-k Sorting on the multi-mesh
• Lower bounds for sorting on mesh-connected architectures
• A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
• scientific article; zbMATH DE number 3958741

zbMATH Keywords

parallel sortingBitonic sorthypermeshMeshSortShearsort

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Optimal parallel algorithms for computing convex hulls and for sorting
• Parallel sorting in two-dimensional VLSI models of computation
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Parallel sorting in two-dimensional VLSI models of computation
• k-k Sorting on the multi-mesh
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors

This page was built for publication: A unified algorithm for sorting on multidimensional mesh-connected processors

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