k-k Sorting on the multi-mesh

DOI10.1007/BFB0036174MaRDI QIDQ5055924zbMATH OpenFDO

Authors Alfons Avermiddig, Andre Osterloh, Manfred Kunde

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0036174

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4035170
• k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
• A unified algorithm for sorting on multidimensional mesh-connected processors
• Lower bounds for sorting on mesh-connected architectures
• scientific article; zbMATH DE number 3958741

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Packet Routing on grids of processors
• Parallel sorting in two-dimensional VLSI models of computation

Cited in

(4)

• scientific article; zbMATH DE number 4035170 (Why is no real title available?)
• Row-Major Sorting on Meshes
• Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
• A unified algorithm for sorting on multidimensional mesh-connected processors

This page was built for publication: k-k Sorting on the multi-mesh

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