The periodic balanced sorting network

DOI10.1145/76359.76362zbMath0698.68042OpenAlexW2096006817WikidataQ127632010 ScholiaQ127632010MaRDI QIDQ3476271

Martin Dowd, Yehoshua Perl, Michael E. Saks, Larry Rudolph

Publication date: 1989

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/76359.76362

zbMATH Keywords

performance analysisparallelrecurrence equationsparallel sortingcombinatorial algorithmsworst- case analysisarithmetic and logic structuresBatcher's networkscomparators networknonnumerical algorithms and problemsperiodic sorting networkshuffle exchange interconnection model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Enumerative combinatorics (05A99) Data structures (68P05)

Related Items (17)

Fast periodic correction networks ⋮ Faster merging networks with a small constant period ⋮ Self-stabilizing smoothing and balancing networks ⋮ Counting networks with arbitrary fan-out ⋮ A super-logarithmic lower bound for hypercubic sorting networks ⋮ The impact of randomization in smoothing networks ⋮ Smoothed analysis of balancing networks ⋮ A sequential sorting network analogous to the batcher merge ⋮ Simulating the Bitonic Sort Using P Systems ⋮ Fragile complexity of adaptive algorithms ⋮ Fragile complexity of comparison-based algorithms ⋮ Fragile complexity of adaptive algorithms ⋮ Generic Constant-Round Oblivious Sorting Algorithm for MPC ⋮ Better understanding of Batcher's merging networks ⋮ Periodic comparator networks ⋮ A note on constructing binary heaps with periodic networks. ⋮ Parallel sorting on Cayley graphs

This page was built for publication: The periodic balanced sorting network