Fast periodic correction networks

Authors:
Grzegorz Stachowiak
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Year:
2006

Citing 7
Cited 0

Sorting in c log n parallel steps

Combinatorica
A correction network for N-sorters

SIAM Journal on Computing
The periodic balanced sorting network

Journal of the ACM (JACM)
Depth optimal sorting networks resistant to k passive faults

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Periodic, random-fault-tolerant correction networks

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Periodic Constant Depth Sorting Networks

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Correction Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of sorting N-element inputs differing from already sorted sequences by t small changes. To perform this task we construct a constant depth comparator network that is applied periodically. The two constructions for this problem made, by previous authors required O(log n + t) iterations of the network. Our construction requires O(log n + (log log N)2(log t)3) iterations which makes it asymptotically faster for t log N.