Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Research note: Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing
Correcting sorted sequences in a single hop radio network
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
| Hi-index | 0.00 |
We consider the problem of sorting sequences obtained from a sorted sequence of n keys by changing the values of at most \mathkeys at some unknown positions. Since even for \matha lower bound \mathon the number of parallel comparison steps applies, any comparator network solving this problem cannot be asymptotically faster than the AKS sorting network.We design a comparator network which sorts the sequences considered for a large range of \math, has a simple architecture and achieves a runtime \math, for a small constant c. We present such networks of depth \mathwith a small constant hidden behind the big "Oh". In particular, for \maththe networks are of depth \math.