Beyond the worst-case bisection bound: Fast sorting and ranking on meshes

DOI10.1007/3-540-60313-1_135zbMATH Open1512.68472MaRDI QIDQ6102292FDOQ6102292

Authors: Michael Kaufmann, Jop F. Sibeyn, Torsten Suel 

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Lower bounds for sorting on mesh-connected architectures
• scientific article; zbMATH DE number 3958741
• k-k Sorting on the multi-mesh
• scientific article; zbMATH DE number 4035170
• scientific article; zbMATH DE number 1026282

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Title not available (Why is that?)
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Scheme for Fast Parallel Communication
• Tight Bounds on the Complexity of Parallel Sorting
• Probabilistic Parallel Algorithms for Sorting and Selection
• Title not available (Why is that?)
• Optimal average case sorting on arrays
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Optimal Distributed Algorithms for Sorting and Ranking

This page was built for publication: Beyond the worst-case bisection bound: Fast sorting and ranking on meshes

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