Periodic Correction Networks

Authors:
Marcin Kik
Affiliations:
-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 6
Cited 1

Sorting in c log n parallel steps

Combinatorica
The periodic balanced sorting network

Journal of the ACM (JACM)
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
Fast and feasible periodic sorting networks of constant depth

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

Research note: Networks for sorting multitonic sequences

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a comparator network that sorts sequences obtained by changing a limited number of keys in a sorted sequence. The network that we present is periodic and has a depth 8. The time required by this algorithm is O(log n+k) with a small constant hidden by "Oh" notation (n is the total number of keys, k is the number of changed keys).