Sorting in constant number of row and column phases on a mesh

DOI10.1007/BF01762132zbMath0648.68072OpenAlexW2081789047MaRDI QIDQ1105380

Eli Gafni, John M. Marberg

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

sortingparallel processingmeshcomplexity analysisrow/column transformationsynchronous computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (8)

A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH ⋮ Self-simulation for the Passive Optical Star model ⋮ Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays ⋮ Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays ⋮ Parallel interval order recognition and construction of interval representations ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Unnamed Item ⋮ Parallel sorting on Cayley graphs

Cites Work

• Tight Bounds on the Complexity of Parallel Sorting
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
• Systolic Sorting on a Mesh-Connected Network
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Unnamed Item
• Unnamed Item

This page was built for publication: Sorting in constant number of row and column phases on a mesh